243 search results - page 23 / 49 » Selectivity Estimation for Boolean Queries |
119
click to vote
PODS
2002
ACM
15 years 9 months ago
2002
ACM
We consider the fundamental operation of applying a conjunction of selection conditions to a set of records. With large main memories available cheaply, systems may choose to keep...
PDCAT
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents a proximity route selection scheme which is adaptive to the underlying network conditions. The proposed scheme repeatedly estimates and updates the total lookup...
106
click to vote
ICDE
2012
IEEE
13 years 2 days ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
177
Voted
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Materializing results from complex aggregation queries helps to significantly improve response times in OLAP servers. This problem is known as the view selection problem: choosing ...