ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Efficient Processing of Proximity Queries for Large Databases.

Walid G. Aref, Daniel Barbará, Stephen Johnson, Sharad Mehrotra: Efficient Processing of Proximity Queries for Large Databases. ICDE 1995: 147-154
@inproceedings{DBLP:conf/icde/ArefBJM95,
  author    = {Walid G. Aref and
               Daniel Barbar{\'a} and
               Stephen Johnson and
               Sharad Mehrotra},
  editor    = {Philip S. Yu and
               Arbee L. P. Chen},
  title     = {Efficient Processing of Proximity Queries for Large Databases},
  booktitle = {Proceedings of the Eleventh International Conference on Data
               Engineering, March 6-10, 1995, Taipei, Taiwan},
  publisher = {IEEE Computer Society},
  year      = {1995},
  isbn      = {0-8186-6910-1},
  pages     = {147-154},
  ee        = {db/conf/icde/ArefBJM95.html},
  crossref  = {DBLP:conf/icde/95},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

Copyright © 1995 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.


ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 6, ICDE 1984-1995" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX

Printed Edition

Philip S. Yu, Arbee L. P. Chen (Eds.): Proceedings of the Eleventh International Conference on Data Engineering, March 6-10, 1995, Taipei, Taiwan. IEEE Computer Society 1995, ISBN 0-8186-6910-1
Contents BibTeX

References

[1]
...
[2]
Jon Louis Bentley, Jerome H. Friedman: Data Structures for Range Searching. ACM Comput. Surv. 11(4): 397-409(1979) BibTeX
[3]
Shi-Kuo Chang: A Visual Language Compiler for Information Retrieval by Visual Reasoning. IEEE Trans. Software Eng. 16(10): 1136-1149(1990) BibTeX
[4]
Larry S. Davis, Nick Roussopoulos: Approximate pattern matching in a pattern database system. Inf. Syst. 5(2): 107-119(1980) BibTeX
[5]
David P. Dobkin, Richard J. Lipton: Multidimensional Searching Problems. SIAM J. Comput. 5(2): 181-186(1976) BibTeX
[6]
...
[7]
Christos Faloutsos, Shari Roseman: Fractals for Secondary Key Retrieval. PODS 1989: 247-252 BibTeX
[8]
Erik G. Hoel, Hanan Samet: A Qualitative Comparison Study of Data Structures for Large Line Segment Databases. SIGMOD Conference 1992: 205-214 BibTeX
[9]
H. V. Jagadish: Spatial Search with Polyhedra. ICDE 1990: 311-319 BibTeX
[10]
Udi Manber, Ricardo A. Baeza-Yates: An Algorithm for String Matching with a Sequence of don't Cares. Inf. Process. Lett. 37(3): 133-136(1991) BibTeX
[11]
Franco P. Preparata, Michael Ian Shamos: Computational Geometry - An Introduction. Springer 1985, ISBN 3-540-96131-3
BibTeX
[12]
Ronald L. Rivest: Partial-Match Retrieval Algorithms. SIAM J. Comput. 5(1): 19-50(1976) BibTeX
[13]
Abdullah Uz Tansel, James Clifford, Shashi K. Gadia, Sushil Jajodia, Arie Segev, Richard T. Snodgrass (Eds.): Temporal Databases: Theory, Design, and Implementation. Benjamin/Cummings 1993, ISBN 0-8053-2413-5
Contents BibTeX

Referenced by

  1. Daniel Barbará, Sharad Mehrotra, Padmavathi Vallabhaneni: The Gold Text Indexing Engine. ICDE 1996: 172-179
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ICDE Proceedings: Copyright © by IEEE,
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:18:18 2009