921 search results - page 20 / 185 » New Data Structures for Orthogonal Range Searching |
220
click to vote
IR
2008
15 years 3 months ago
2008
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...
144
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
132
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Currently, the increasing rate of routing lookups in Internet routers, the large number of prefixes and also the transition from IPV4 to IPV6, have caused Internet designers to pro...
143
Voted
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
134
Voted
VLDB
2000
ACM
15 years 7 months ago
2000
ACM
Primary B+ -tree, a variant of B+ -tree structure with row data in leaf blocks, is an ideal storage organization for queries involving exact match and/or range search on primary k...