Sciweavers

258 search results - page 16 / 52
» Multidimensional Index Structures in Relational Databases
Sort
View
SIGMOD
1998
ACM
142views Database» more  SIGMOD 1998»
13 years 11 months ago
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Amb...
ICDE
2009
IEEE
143views Database» more  ICDE 2009»
13 years 4 months ago
Incremental Reverse Nearest Neighbor Ranking
In this paper, we formalize the novel concept of incremental reverse nearest neighbor ranking and suggest an original solution for this problem. We propose an efficient approach fo...
Hans-Peter Kriegel, Peer Kröger, Matthias Ren...
EDBT
2006
ACM
255views Database» more  EDBT 2006»
14 years 6 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald
DATESO
2004
174views Database» more  DATESO 2004»
13 years 8 months ago
On Efficient Part-match Querying of XML Data
The XML language have been becoming de-facto a standard for representation of heterogeneous data in the Internet. From database point of view, XML is a new approach to data modelli...
Michal Krátký, Marek Andrt
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 7 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti