765 search results - page 117 / 153 » Query Processing over Incomplete Autonomous Databases |
SSDBM
2007
IEEE
15 years 4 months ago
2007
IEEE
Space-partitioning trees, like the disk-based trie, quadtree, kd-tree and their variants, are a family of access methods that index multi-dimensional objects. In the case of index...
170
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we describe an application, PubCloud that uses tag clouds for the summarization of results from queries over the PubMed database of biomedical literature. PubCloud ...
138
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
One of the most common operations in analytic query processing is the application of an aggregate function to the result of a relational join. We describe an algorithm for computi...
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
Many algorithms have been proposed to approximate holistic aggregates, such as quantiles and heavy hitters, over data streams. However, little work has been done to explore what t...