25 search results - page 3 / 5 » Data Replication for External Searching in Static Tree Struc... |
JACM
2007
14 years 9 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
138
click to vote
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
CIKM
2009
Springer
15 years 1 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
VLDB
1999
ACM
15 years 1 months ago
1999
ACM
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
87
Voted
WSCG
2004
14 years 11 months ago
2004
In this paper, the collision prediction between polyhedra under screw motions and a static scene using a new K dimensional tree data structure (Multiresolution Kdtree, MKtree) is ...