Sciweavers

198 search results - page 11 / 40
» Dynamic spatial approximation trees
Sort
View
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
14 years 1 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
SAC
2005
ACM
14 years 3 months ago
Indexing continuously changing data with mean-variance tree
: Traditional spatial indexes like R-tree usually assume the database is not updated frequently. In applications like location-based services and sensor networks, this assumption i...
Yuni Xia, Sunil Prabhakar, Shan Lei, Reynold Cheng...
GIS
2005
ACM
14 years 11 months ago
Improving the R*-tree with outlier handling techniques
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
Tian Xia, Donghui Zhang
AAAI
1994
13 years 11 months ago
Intelligent Automated Grid Generation for Numerical Simulations
Numerical simulation of partial differential equations (PDEs) plays a crucial role in predicting the behavior of physical systems and in modern engineering design. However, in ord...
Ke-Thia Yao, Andrew Gelsey
VLDB
2002
ACM
184views Database» more  VLDB 2002»
14 years 10 months ago
Database indexing for large DNA and protein sequence collections
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Ela Hunt, Malcolm P. Atkinson, Robert W. Irving