6562 search results - page 937 / 1313 » Noetherianity and Combination Problems |
229
click to vote
SIGMOD
2004
ACM
16 years 7 months ago
2004
ACM
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
178
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
While work in recent years has demonstrated that wavelets can be efficiently used to compress large quantities of data and provide fast and fairly accurate answers to queries, lit...
222
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
166
click to vote
SIGMOD
2002
ACM
16 years 7 months ago
2002
ACM
Recently, Haas and Hellerstein proposed the hash ripple join algorithm in the context of online aggregation. Although the algorithm rapidly gives a good estimate for many join-agg...
209
click to vote
SIGMOD
2002
ACM
16 years 7 months ago
2002
ACM
Physical database design is important for query performance in a shared-nothing parallel database system, in which data is horizontally partitioned among multiple independent node...