Sciweavers

2001 search results - page 179 / 401
» Indexing in a Hypertext Database
Sort
View
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
13 years 10 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
SSDBM
2006
IEEE
153views Database» more  SSDBM 2006»
14 years 4 months ago
HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets using Fast Bitmap Indices
Large scale scientific data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user com...
Luke J. Gosink, John Shalf, Kurt Stockinger, Keshe...
SEBD
1996
94views Database» more  SEBD 1996»
13 years 11 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
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 11 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian
DASFAA
2007
IEEE
141views Database» more  DASFAA 2007»
14 years 4 months ago
CST-Trees: Cache Sensitive T-Trees
Abstract. Researchers have modified existing index structures into ones optimized for CPU cache performance in main memory database environments. A Cache Sensitive B+-Tree is one o...
Ig-hoon Lee, Junho Shim, Sang-goo Lee, Jonghoon Ch...