Sciweavers

721 search results - page 76 / 145
» Layered Index Structures in Document Database Systems
Sort
View
IEEECIT
2005
IEEE
15 years 9 months ago
Case Study: Distance-Based Image Retrieval in the MoBIoS DBMS
Similarity search leveraging distance-based index structures is increasingly being used for complex data types. It has been shown that for high dimensional uniform vectors with si...
Rui Mao, Wenguo Liu, Daniel P. Miranker, Qasim Iqb...
SEBD
1996
94views Database» more  SEBD 1996»
15 years 5 months ago
Efficient Algorithm for determining the Optimal Execution Strategy for Path Queries in OODBS
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
Weimin Chen, Karl Aberer
GIS
2005
ACM
16 years 4 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
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
16 years 3 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
GEOINFO
2003
15 years 5 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...