2498 search results - page 240 / 500 » Data Structures with Unpredictable Timing |
230
Voted
ICDE
2005
IEEE
16 years 4 months ago
2005
IEEE
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
110
Voted
WADS
1989
Springer
15 years 6 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
127
Voted
STOC
2001
ACM
16 years 2 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
102
Voted
DATE
2006
IEEE
15 years 8 months ago
2006
IEEE
In many computer systems with large data computations, the delay of memory access is one of the major performance bottlenecks. In this paper, we propose an enhanced field remappi...
111
click to vote
VLDB
2000
ACM
15 years 6 months ago
2000
ACM
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous val...