2498 search results - page 196 / 500 » Data Structures with Unpredictable Timing |
142
click to vote
IDEAS
2007
IEEE
15 years 8 months ago
2007
IEEE
A sliding window join (SWJoin) is becoming an integral operation in every stream data management system. In some streaming applications the increasing volume of streamed data as w...
115
click to vote
COCOON
1999
Springer
15 years 6 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
214
click to vote
PODS
2009
ACM
16 years 2 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
113
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
128
click to vote
MOBIDE
2005
ACM
15 years 8 months ago
2005
ACM
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...