Sciweavers

2223 search results - page 146 / 445
» Query Optimization in an OODBMS
Sort
View
145
Voted
PPAM
2005
Springer
15 years 9 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale
115
Voted
ERSHOV
2006
Springer
15 years 7 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 ...
170
Voted
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
15 years 5 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 3 months 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...
149
Voted
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 5 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