Sciweavers

4790 search results - page 504 / 958
» Reverse Query Processing
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 5 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
SIGMOD
2007
ACM
108views Database» more  SIGMOD 2007»
16 years 5 months ago
Travel time estimation using NiagaraST and latte
To address increasing traffic congestion and its associated consequences, traffic managers are turning to intelligent transportation management. The latte project is extending dat...
Kristin Tufte, Jin Li, David Maier, Vassilis Papad...
SIGMOD
2005
ACM
100views Database» more  SIGMOD 2005»
16 years 5 months ago
A Disk-Based Join With Probabilistic Guarantees
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...
Chris Jermaine, Alin Dobra, Subramanian Arumugam, ...
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
16 years 5 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine
SIGMOD
2004
ACM
161views Database» more  SIGMOD 2004»
16 years 5 months ago
Approximation Techniques for Spatial Data
Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage spatial objects such as points, lines, and hyper-rectangles, often have very high ...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald