Sciweavers

627 search results - page 30 / 126
» Efficient Top-k Query Evaluation on Probabilistic Data
Sort
View
EDBT
2002
ACM
129views Database» more  EDBT 2002»
16 years 6 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 8 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
CIKM
2009
Springer
15 years 10 months ago
Probabilistic skyline queries
The ability to deal with uncertain information is becoming increasingly important for modern database applications. Whereas a conventional (certain) object is usually represented ...
Christian Böhm, Frank Fiedler, Annahita Oswal...
ICDE
2008
IEEE
160views Database» more  ICDE 2008»
16 years 7 months ago
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
Anish Das Sarma, Martin Theobald, Jennifer Widom
ICDE
2006
IEEE
141views Database» more  ICDE 2006»
16 years 7 months ago
Clean Answers over Dirty Databases: A Probabilistic Approach
The detection of duplicate tuples, corresponding to the same real-world entity, is an important task in data integration and cleaning. While many techniques exist to identify such...
Ariel Fuxman, Periklis Andritsos, Renée J. ...