277 search results - page 38 / 56 » Opportunistic Data Structures for Range Queries |
IJOCI
2010
13 years 6 months ago
2010
We present a time-efficient approach to index objects moving on the plane to efficiently answer range queries about their future positions. Each object is moving with non small ve...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
CIKM
2011
Springer
12 years 8 months ago
2011
Springer
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
SEM
2004
Springer
14 years 2 months ago
2004
Springer
Large-scale information processing applications must rapidly search through high volume streams of structured and unstructured textual data to locate useful information. Content-ba...
COMPGEOM
2001
ACM
14 years 14 days ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...