Sciweavers

258 search results - page 14 / 52
» Multidimensional Index Structures in Relational Databases
Sort
View
SSD
2001
Springer
113views Database» more  SSD 2001»
13 years 11 months ago
Object-Relational Indexing for General Interval Relationships
Intervals represent a fundamental data type for temporal, scientific, and spatial databases where time stamps and point data are extended to time spans and range data, respectively...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 8 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
DKE
1998
88views more  DKE 1998»
13 years 6 months ago
Temporal Grid File: A File Structure for Interval Data
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
Chiang Lee, Te-Ming Tseng
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
14 years 7 months ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani
EWCBR
2000
Springer
13 years 10 months ago
An Efficient Approach to Similarity-Based Retrieval on Top of Relational Databases
This paper presents an approach to realize a case retrieval engine on top of a relational database. In a nutshell the core idea is to approximate a similarity-based retrieval with ...
Jürgen Schumacher, Ralph Bergmann