Jonathan Goldstein, Raghu Ramakrishnan, et al.  Home/Search
Context Related
| wisc.edu/~jiebing/pods97.ps wisc.edu/~uri/Papers/pods_97.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisc.edu/~jiebing/jiebing (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The emergence of several new application domains for databases has introduced the need for more efficient complex query handling than databases currently support. These application domains include On-Line Analytical Processing (OLAP), Geographical Information Systems (GIS), and scientific databases. This paper focuses attention on a form of selection query, expressible in SQL but not evaluated efficiently by current DBMSs, with wide applicability in these new problem domains. We introduce a... (Update)
Cited by: More
Efficient Indexing Methods for Probabilistic.. - Cheng, Xia.. (2004) (Correct)
Reverse kNN Search in Arbitrary Dimensionality - Dimitris (2004) (Correct)
Indexing Mobile Objects Using Dual Transformations - Kollios, Papadopoulos.. (Correct)
Active bibliography (related documents): More All
0.2: LSH Forest: Self-Tuning Indexes for Similarity Search - Mayank Bawa Bawa (2005) (Correct)
0.2: Density-Based Indexing for Approximate Nearest-Neighbor.. - Bennett, Fayyad, Geiger (1999) (Correct)
Similar documents based on text: More All
0.4: When Is "Nearest Neighbor" Meaningful? - Kevin Beyer Jonathan (1999) (Correct)
0.3: Using Constraints to Query R*-Trees - Goldstein, Ramakrishnan, Shaft, Yu (1996) (Correct)
0.2: Compressing Relations and Indexes - Goldstein, Ramakrishnan, Shaft (1998) (Correct)
Related documents from co-citation: More All
11: trees: A dynamic index structure for spatial searching (context) - Guttman - 1984
11: tree: an efficient and Robust Access Method for Points and Rectangles (context) - Beckmann, Kriegel et al. - 1990
10: Optimal dynamic interval management in external memory - Arge, Vitter - 1996
BibTeX entry: (Update)
J. Goldstein, R. Ramakrishnan, U. Shaft, and J.-B. Yu. Processing queries by linear constraints. In Proc. ACM Symp. Principles of Database Systems, pages 257--267, 1997. http://citeseer.ist.psu.edu/goldstein97processing.html More
@inproceedings{ goldstein97processing,
author = "Jonathan Goldstein and Raghu Ramakrishnan and Uri Shaft and Jie-Bing Yu",
title = "Processing queries by linear constraints",
pages = "257--267",
year = "1997",
url = "citeseer.ist.psu.edu/goldstein97processing.html" }
Citations (may not include all citations):4 Tree: An efficient and robust access method for points and r.. (context) - Seeger - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.wisc.edu/~jiebing/jiebing.html): More
Processing Satellite Images on Tertiary Storage: A Study of the .. - Jiebing Yu (1996) (Correct)
Using Constraints to Query R*-Trees - Goldstein, Ramakrishnan, Shaft, Yu (1996) (Correct)
Client-Server Paradise - DeWitt, Kabra, Luo, Patel, Yu (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC