Sciweavers

301 search results - page 18 / 61
» Efficient Sketches for the Set Query Problem
Sort
View
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
16 years 21 days ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
SIGMOD
2009
ACM
147views Database» more  SIGMOD 2009»
15 years 11 months ago
XML keyword query refinement
Existing works in XML keyword search have addressed the problem of finding matching results of a query. However, user input queries always contain irrelevant or mismatched terms, ...
Jiaheng Lu, Zhifeng Bao, Tok Wang Ling, Xiaofeng M...
JDCTA
2010
151views more  JDCTA 2010»
14 years 5 months ago
Research on Querying Node Probability Method in Probabilistic XML Data Based on Possible World
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
Jianwei Wang, Zhongxiao Hao
DEXA
2008
Springer
132views Database» more  DEXA 2008»
15 years 23 days ago
Efficient Updates for Continuous Skyline Computations
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
SIGMOD
2008
ACM
167views Database» more  SIGMOD 2008»
15 years 11 months ago
Efficient lineage tracking for scientific workflows
Data lineage and data provenance are key to the management of scientific data. Not knowing the exact provenance and processing pipeline used to produce a derived data set often re...
Thomas Heinis, Gustavo Alonso