Sciweavers

486 search results - page 6 / 98
» Evaluating Top-k Queries over Web-Accessible Databases
Sort
View
VLDB
2004
ACM
161views Database» more  VLDB 2004»
15 years 12 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
ICDE
2007
IEEE
137views Database» more  ICDE 2007»
16 years 1 months ago
SAO: A Stream Index for Answering Linear Optimization Queries
Linear optimization queries retrieve the top-K tuples in a sliding window of a data stream that maximize/minimize the linearly weighted sums of certain attribute values. To effici...
Gang Luo, Kun-Lung Wu, Philip S. Yu
SIGMOD
2005
ACM
168views Database» more  SIGMOD 2005»
15 years 12 months ago
No pane, no gain: efficient evaluation of sliding-window aggregates over data streams
Window queries are proving essential to data-stream processing. In this paper, we present an approach for evaluating sliding-window aggregate queries that reduces both space and c...
Jin Li, David Maier, Kristin Tufte, Vassilis Papad...
ICDT
2007
ACM
126views Database» more  ICDT 2007»
15 years 5 months ago
Containment of Conjunctive Queries over Databases with Null Values
Abstract. We study containment of conjunctive queries that are evaluated over databases that may contain tuples with null values. We assume the semantics of SQL for single block qu...
Carles Farré, Werner Nutt, Ernest Teniente,...
IS
2007
14 years 11 months ago
Evaluation of probabilistic queries over imprecise data in constantly-evolving environments
Sensors are often employed to monitor continuously changing entities like locations of moving objects and temperature. The sensor readings are reported to a database system, and a...
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabha...