643 search results - page 45 / 129 » Dynamic prioritization of database queries |
DATESO
2009
14 years 7 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
101
click to vote
EDBT
2010
ACM
14 years 7 months ago
2010
ACM
Spatial data are common in many scientific and commercial domains such as geographical information systems and gene/protein expression profiles. Querying for distribution patterns...
ICDE
2007
IEEE
15 years 4 months ago
2007
IEEE
Adaptive query processing is of utmost importance for the scalability of data stream processing systems due to the long-running queries and fluctuating stream characteristics. An...
114
click to vote
DASFAA
1991
IEEE
15 years 1 months ago
1991
IEEE
: We present a new dynamic hashedfile organization that solvesmostproblems associatedwith the directory of the grid file proposed by Nievergelt et al. Our schemeis a multilevel ext...
182
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
Efficient evaluation of XML queries requires the determination of whether a relationship exists between two elements. A number of labeling schemes have been designed to label the ...