Sciweavers

610 search results - page 34 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
15 years 3 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 7 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
ICDE
2004
IEEE
118views Database» more  ICDE 2004»
16 years 4 months ago
A Peer-to-peer Framework for Caching Range Queries
Peer-to-peer systems are mainly used for object sharing although they can provide the infrastructure for many other applications. In this paper, we extend the idea of object shari...
Ozgur D. Sahin, Abhishek Gupta, Divyakant Agrawal,...
EDBT
2004
ACM
139views Database» more  EDBT 2004»
16 years 3 months ago
Efficient Distributed Skylining for Web Information Systems
Though skyline queries already have claimed their place in retrieval over central databases, their application in Web information systems up to now was impossible due to the distri...
Wolf-Tilo Balke, Ulrich Güntzer, Jason Xin Zh...
EDBT
2006
ACM
156views Database» more  EDBT 2006»
16 years 3 months ago
Indexing Incomplete Databases
Incomplete databases, that is, databases that are missing data, are present in many research domains. It is important to derive techniques to access these databases efficiently. We...
Guadalupe Canahuate, Michael Gibas, Hakan Ferhatos...