Sciweavers

792 search results - page 45 / 159
» Computing Iceberg Queries Efficiently
Sort
View
ICDE
2007
IEEE
173views Database» more  ICDE 2007»
15 years 11 months ago
Top-k Query Processing in Uncertain Databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between score and uncertainty makes traditio...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...
COLT
2006
Springer
15 years 1 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
VLDB
2007
ACM
169views Database» more  VLDB 2007»
15 years 10 months ago
Peer-to-Peer Similarity Search in Metric Spaces
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
Christos Doulkeridis, Akrivi Vlachou, Yannis Kotid...
ICDE
2003
IEEE
122views Database» more  ICDE 2003»
15 years 11 months ago
XML Publishing: Look at Siblings too!
In order to publish a nested XML document from flat relational data, multiple SQL queries are often needed. The efficiency of publishing relies on how fast these queries can be ev...
Sihem Amer-Yahia, Yannis Kotidis, Divesh Srivastav...
CORR
2010
Springer
138views Education» more  CORR 2010»
14 years 10 months ago
On building minimal automaton for subset matching queries
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Kimmo Fredriksson