Sciweavers

3269 search results - page 345 / 654
» Query Optimization for XML
Sort
View
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
15 years 6 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 5 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...
161
Voted
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 6 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
ICDE
2010
IEEE
562views Database» more  ICDE 2010»
16 years 4 months ago
Multi-Guarded Safe Zone: An Effective Technique to Monitor Moving Circular Range Queries
Given a positive value r, a circular range query returns the objects that lie within the distance r of the query location. In this paper, we study the circular range queries that c...
Muhammad Aamir Cheema, Ljiljana Brankovic, Xuemin ...
149
Voted
DEXA
2004
Springer
172views Database» more  DEXA 2004»
15 years 10 months ago
On the Automation of Similarity Information Maintenance in Flexible Query Answering Systems
This paper proposes a method for automatic maintaining the similarity information for a particular class of Flexible Query Answering Systems (FQAS). The paper describes the three m...
Balázs Csanád Csáji, Josef K&...