Sciweavers

1160 search results - page 160 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
ICDE
2002
IEEE
102views Database» more  ICDE 2002»
15 years 11 months ago
Cost Models for Overlapping and Multi-Version B-Trees
Overlapping and multi-version techniques are two popular frameworks that transform an ephemeral index into a multiple logical-tree structure in order to support versioning databas...
Yufei Tao, Dimitris Papadias, Jun Zhang
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
SIGMOD
1999
ACM
110views Database» more  SIGMOD 1999»
15 years 2 months ago
Multi-dimensional Selectivity Estimation Using Compressed Histogram Information
The database query optimizer requires the estimation of the query selectivity to find the most efficient access plan. For queries referencing multiple attributes from the same rel...
Ju-Hong Lee, Deok-Hwan Kim, Chin-Wan Chung
AVI
2006
14 years 11 months ago
Navigation in degree of interest trees
We present an experiment that compares how people perform search tasks in a degree-of-interest browser and in a Windows-Explorer-like browser. Our results show that, whereas users...
Raluca Budiu, Peter Pirolli, Michael Fleetwood
SIGMOD
2007
ACM
136views Database» more  SIGMOD 2007»
15 years 10 months ago
Progressive optimization in a shared-nothing parallel database
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache...