Sciweavers

258 search results - page 19 / 52
» Multidimensional Index Structures in Relational Databases
Sort
View
MOBIQUITOUS
2007
IEEE
14 years 1 months ago
Assessing Standard and Inverted Skip Graphs Using Multi-Dimensional Range Queries and Mobile Nodes
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
Gregory J. Brault, Christopher J. Augeri, Barry E....
ICDT
2005
ACM
88views Database» more  ICDT 2005»
14 years 8 days ago
When Is Nearest Neighbors Indexable?
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
Uri Shaft, Raghu Ramakrishnan
VLDB
2000
ACM
229views Database» more  VLDB 2000»
13 years 10 months ago
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces
Many emerging application domains require database systems to support efficient access over highly multidimensional datasets. The current state-of-the-art technique to indexing hi...
Kaushik Chakrabarti, Sharad Mehrotra
CIKM
2009
Springer
14 years 1 months ago
Structure-aware indexing for keyword search in databases
Most of existing methods of keyword search over relational databases find the Steiner trees composed of relevant tuples as the answers. They identify the Steiner trees by discove...
Guoliang Li, Jianhua Feng, Jianyong Wang
ICDE
2002
IEEE
143views Database» more  ICDE 2002»
14 years 8 months ago
Discovering Similar Multidimensional Trajectories
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
Michail Vlachos, Dimitrios Gunopulos, George Kolli...