Sciweavers

6004 search results - page 273 / 1201
» Parallelizing query optimization
Sort
View
106
Voted
SIGMOD
2004
ACM
123views Database» more  SIGMOD 2004»
16 years 23 days ago
Automatic Categorization of Query Results
Exploratory ad-hoc queries could return too many answers ? a phenomenon commonly referred to as "information overload". In this paper, we propose to automatically catego...
Kaushik Chakrabarti, Surajit Chaudhuri, Seung-won ...
95
Voted
ERSHOV
2006
Springer
15 years 4 months ago
Chase of Recursive Queries
In this work, we present a semantic query optimization technique to improve the efficiency of the evaluation of a subset of SQL:1999 recursive queries. Using datalog notation, we c...
Nieves R. Brisaboa, Antonio Fariña, Miguel ...
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
15 years 2 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
SIGMOD
2006
ACM
150views Database» more  SIGMOD 2006»
16 years 23 days ago
On-the-fly sharing for streamed aggregation
Data streaming systems are becoming essential for monitoring applications such as financial analysis and network intrusion detection. These systems often have to process many simi...
Sailesh Krishnamurthy, Chung Wu, Michael J. Frankl...
114
Voted
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 2 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu