Sciweavers

5372 search results - page 722 / 1075
» complexity 2007
Sort
View
VLDB
2007
ACM
129views Database» more  VLDB 2007»
16 years 7 months ago
Efficient Skyline Computation over Low-Cardinality Domains
Current skyline evaluation techniques follow a common paradigm that eliminates data elements from skyline consideration by finding other elements in the dataset that dominate them...
Michael D. Morse, Jignesh M. Patel, H. V. Jagadish
273
Voted
VLDB
2007
ACM
105views Database» more  VLDB 2007»
16 years 7 months ago
Using a distributed quadtree index in peer-to-peer networks
Abstract Peer-to-peer (P2P) networks have become a powerful means for online data exchange. Currently, users are primarily utilizing these networks to perform exact-match queries a...
Egemen Tanin, Aaron Harwood, Hanan Samet
SIGMOD
2007
ACM
122views Database» more  SIGMOD 2007»
16 years 7 months ago
XQuery layers
XML is the data interoperability standard in many application domains. Therefore, an increasing number of researchers and professionals, who are not computer scientists (although ...
Daniele Braga, Alessandro Campi, Stefano Ceri, Pao...
SIGMOD
2007
ACM
170views Database» more  SIGMOD 2007»
16 years 7 months ago
Cardinality estimation using sample views with quality assurance
Accurate cardinality estimation is critically important to high-quality query optimization. It is well known that conventional cardinality estimation based on histograms or simila...
Per-Åke Larson, Wolfgang Lehner, Jingren Zho...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang