11214 search results - page 1998 / 2243 » Just-in-time data structures |
SSD
1993
Springer
15 years 4 months ago
1993
Springer
: Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems impose stringent requirements on their storage and acc...
106
click to vote
SIGSOFT
1994
ACM
15 years 4 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
100
click to vote
WG
1993
Springer
15 years 4 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
VLDB
1994
ACM
15 years 4 months ago
1994
ACM
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
ISAAC
1992
Springer
15 years 4 months ago
1992
Springer
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...