Query Processing for Distance Metrics.
Jason Tsong-Li Wang, Dennis Shasha:
Query Processing for Distance Metrics.
VLDB 1990: 602-613@inproceedings{DBLP:conf/vldb/WangS90,
author = {Jason Tsong-Li Wang and
Dennis Shasha},
editor = {Dennis McLeod and
Ron Sacks-Davis and
Hans-J{\"o}rg Schek},
title = {Query Processing for Distance Metrics},
booktitle = {16th International Conference on Very Large Data Bases, August
13-16, 1990, Brisbane, Queensland, Australia, Proceedings},
publisher = {Morgan Kaufmann},
year = {1990},
isbn = {1-55860-149-X},
pages = {602-613},
ee = {db/conf/vldb/WangS90.html},
crossref = {DBLP:conf/vldb/90},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
In applications such as vision and molecular biology, a common problem is to find the similar objects to a given target (according to some distance measure)in a large database.
This paper presents a scheme for query processing in such situations.
The basic strategy is to (partially) precompute inter-object distances, and byusing the distance information and the triangle inequality, we eliminate the need to calculate certain object distances while evaluating queries.
We propose several heuristics that may speed up query evaluation.
A series of experiments are then performed to evaluate the effectiveness of our scheme and the relative performance of the heuristics for different queries.
Finally we investigate the possibility of parallelizing our scheme through simulation.
Our results show that parallelism is best applied in the later stages in evaluating a query.
Copyright © 1990 by the VLDB Endowment.
Permission to copy without fee all or part of this material is granted provided that the copies are not made or
distributed for direct commercial advantage, the VLDB
copyright notice and the title of the publication and
its date appear, and notice is given that copying
is by the permission of the Very Large Data Base
Endowment. To copy otherwise, or to republish, requires
a fee and/or special permission from the Endowment.
Online Paper
CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Dennis McLeod, Ron Sacks-Davis, Hans-Jörg Schek (Eds.):
16th International Conference on Very Large Data Bases, August 13-16, 1990, Brisbane, Queensland, Australia, Proceedings.
Morgan Kaufmann 1990, ISBN 1-55860-149-X
References
- [1]
- Rakesh Agrawal, H. V. Jagadish:
Efficient Search in Very Large Databases.
VLDB 1988: 407-418
- [2]
- Rakesh Agrawal, H. V. Jagadish:
Materialization and Incremental Update of Path Information.
ICDE 1989: 374-383
- [3]
- Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
Data Structures and Algorithms.
Addison-Wesley 1983, ISBN 0-201-00023-7
- [4]
- Elisa Bertino, Won Kim:
Indexing Techniques for Queries on Nested Objects.
IEEE Trans. Knowl. Data Eng. 1(2): 196-214(1989)
- [5]
- ...
- [6]
- Walter A. Burkhard, Robert M. Keller:
Some Approaches to Best-Match File Searching.
Commun. ACM 16(4): 230-236(1973)
- [7]
- ...
- [8]
- ...
- [9]
- Larry S. Davis, Nick Roussopoulos:
Approximate pattern matching in a pattern database system.
Inf. Syst. 5(2): 107-119(1980)
- [10]
- Umeshwar Dayal, Frank Manola, Alejandro P. Buchmann, Upen S. Chakravarthy, David Goldhirsch, Sandra Heiler, Jack A. Orenstein, Arnon Rosenthal:
Simplifying Complex Objects: The PROBE Approach to Modelling and Querying Them.
BTW 1987: 17-37
- [11]
- Caroline M. Eastman, Stephen F. Weiss:
Tree structures for high dimensionality nearest neighbor searching.
Inf. Syst. 7(2): 115-122(1982)
- [12]
- ...
- [13]
- Keinosuke Fukunaga, Patrenahalli M. Narendra:
A Branch and Bound Algorithms for Computing k-nearest Neighbors.
IEEE Trans. Computers 24(7): 750-753(1975)
- [14]
- Theo Härder, Harald Schöning, Andrea Sikeler:
Parallelism in Processing Queries on Complex Objects.
DPDS 1988: 131-143
- [15]
- Andreas Henrich, Hans-Werner Six, Peter Widmayer:
The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects.
VLDB 1989: 45-53
- [16]
- Tetsuro Ito, Makoto Kizawa:
Hierarchical File Organization and Its Application to Similar-String Matching.
ACM Trans. Database Syst. 8(3): 410-433(1983)
- [17]
- ...
- [18]
- ...
- [19]
- D. T. Lee, Franco P. Preparata:
Computational Geometry - A Survey.
IEEE Trans. Computers 33(12): 1072-1101(1984)
- [20]
- ...
- [21]
- ...
- [22]
- Jack A. Orenstein:
Spatial Query Processing in an Object-Oriented Database System.
SIGMOD Conference 1986: 326-336
- [23]
- Jack A. Orenstein:
Redundancy in Spatial Databases.
SIGMOD Conference 1989: 295-305
- [24]
- ...
- [25]
- Gunter Saake, Volker Linnemann, Peter Pistor, Lutz Michael Wegner:
Sorting, Grouping and Duplicate Elimination in the Advanced Information Management Prototype.
VLDB 1989: 307-316
- [26]
- ...
- [27]
- Timos K. Sellis, Nick Roussopoulos, Christos Faloutsos:
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects.
VLDB 1987: 507-518
- [28]
- ...
- [29]
- Marvin B. Shapiro:
The Choice of Reference Points in Best-Match File Searching.
Commun. ACM 20(5): 339-343(1977)
- [30]
- ...
- [31]
- ...
- [32]
- Patrick Valduriez, Setrag Khoshafian, George P. Copeland:
Implementation Techniques of Complex Objects.
VLDB 1986: 101-110
- [33]
- Stephen Warshall:
A Theorem on Boolean Matrices.
J. ACM 9(1): 11-12(1962)
- [34]
- Carlo Zaniolo:
The Representation and Deductive Retrieval of Complex Objects.
VLDB 1985: 458-469
Copyright © Fri Mar 12 17:22:50 2010
by Michael Ley (ley@uni-trier.de)