Sciweavers

376 search results - page 8 / 76
» Semantics and Evaluation of Top-k Queries in Probabilistic D...
Sort
View
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 7 months ago
FleXPath: Flexible Structure and Full-Text Querying for XML
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank ...
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 8 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»
14 years 9 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
IS
2007
13 years 7 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...
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Top-k Query Evaluation on Probabilistic Data
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
Christopher Re, Nilesh N. Dalvi, Dan Suciu