Sciweavers

258 search results - page 11 / 52
» Multidimensional Index Structures in Relational Databases
Sort
View
ICMCS
1999
IEEE
119views Multimedia» more  ICMCS 1999»
13 years 11 months ago
Indexing by Shape of Image Databases Based on Extended Grid Files
In this paper, we propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailo...
Carlo Combi, Gian Luca Foresti, Massimo Francesche...
DATESO
2009
119views Database» more  DATESO 2009»
13 years 4 months ago
Efficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
Peter Chovanec, Michal Krátký
ADC
2000
Springer
326views Database» more  ADC 2000»
13 years 11 months ago
T-Tree or B-Tree: Main Memory Database Index Structure Revisited
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
Hongjun Lu, Yuet Yeung Ng, Zengping Tian
SIGMOD
2002
ACM
124views Database» more  SIGMOD 2002»
14 years 6 months ago
Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data
Spatial indexing has been one of the active focus areas in recent database research. Several variants of Quadtree and R-tree indexes have been proposed in database literature. In ...
Kothuri Venkata Ravi Kanth, Siva Ravada, Daniel Ab...
VLDB
1994
ACM
99views Database» more  VLDB 1994»
13 years 10 months ago
Join Index Hierarchies for Supporting Efficient Navigations in Object-Oriented Databases
A join index hierarchy method is proposed to handle the "goto's on disk" problem in objectoriented query processing. The method constructs a hierarchy of join indic...
Zhaohui Xie, Jiawei Han