Sciweavers

958 search results - page 26 / 192
» The Time Index: An Access Structure for Temporal Data
Sort
View
ICDE
2003
IEEE
117views Database» more  ICDE 2003»
14 years 9 months ago
Design and Implementation of a Temporal Extension of SQL
We present a valid-time extension of SQL and investigate its efficient implementation on an Object-Relational database system. We propose an approach where temporal queries are ex...
Cindy Xinmin Chen, Jiejun Kong, Carlo Zaniolo
ICCS
2007
Springer
14 years 2 months ago
Searching and Updating Metric Space Databases Using the Parallel EGNAT
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
Mauricio Marín, Roberto Uribe, Ricardo J. B...
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
14 years 8 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
BTW
2003
Springer
94views Database» more  BTW 2003»
14 years 1 months ago
The Paradigm of Relational Indexing: a Survey
Abstract: In order to achieve efficient execution plans for queries comprising userdefined data types and predicates, the database system has to be provided with appropriate index ...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SSDBM
2009
IEEE
149views Database» more  SSDBM 2009»
14 years 3 months ago
Reverse k-Nearest Neighbor Search Based on Aggregate Point Access Methods
Abstract. We propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem in Euclidean spaces. Compared to the limitations of existing methods for ...
Hans-Peter Kriegel, Peer Kröger, Matthias Ren...