Processing queries by linear constraints

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Processing queries by linear constraints

Full text

Pdf (1.86 MB)

Source

Symposium on Principles of Database Systems archive
Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents

Tucson, Arizona, United States

Pages: 257 - 267

Year of Publication: 1997

ISBN:0-89791-910-6

Authors

Jonathan Goldstein	Computer Sciences Department, University of Wisconsin-Madison, 1210 W. Dayton St., Madison, WI
Raghu Ramakrishnan	Computer Sciences Department, University of Wisconsin-Madison, 1210 W. Dayton St., Madison, WI
Uri Shaft	Computer Sciences Department, University of Wisconsin-Madison, 1210 W. Dayton St., Madison, WI
Jie-Bing Yu	Computer Sciences Department, University of Wisconsin-Madison, 1210 W. Dayton St., Madison, WI

Sponsor

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 22, Citation Count: 14

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/263661.263689 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Norbert Beckmann , Hans-Peter Kriegel , Ralf Schneider , Bernhard Seeger, The R*-tree: an efficient and robust access method for points and rectangles, Proceedings of the 1990 ACM SIGMOD international conference on Management of data, p.322-331, May 23-26, 1990, Atlantic City, New Jersey, United States
	2	G. B. Dantzig. Linear Programming and Eztenslons. Princeton University Press, Princeton, N.J.t 1963.
	3	David J. DeWitt , Navin Kabra , Jun Luo , Jignesh M. Patel , Jie-Bing Yu, Client-Server Paradise, Proceedings of the 20th International Conference on Very Large Data Bases, p.558-569, September 12-15, 1994
	4	Shu-Cherng Fang , Sarat Puthenpura, Linear optimization and extensions: theory and algorithms, Prentice-Hall, Inc., Upper Saddle River, NJ, 1993
	5	J. Goldstein, R. Ramakrishnan, and U. Shaft abd J.- B. Yu. Using constraints to query R*-Trees. Techmcal Report TR1301, Comp. Sci. Dept., Univ. of Wisconsin- Madison, 1996.
	6	O. Gfinther and E. Wong. A dual approach to detect polyhedral intersection in arbitrary dimensions. In Proc. 25th Annual Allerton Conf. on Comm., Control and Comp.,,pages 859-868, 1987.
	7	Antonin Guttman, R-trees: a dynamic index structure for spatial searching, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, June 18-21, 1984, Boston, Massachusetts
	8	H. -P. Kriegel , M. Schiwietz , R. Schneider , B. Seeger, Performance comparison of point and spatial access methods, Proceedings of the first symposium on Design and implementation of large spatial databases, p.89-114, February 1990, Santa Barbara, California, United States
	9	Bernhard Seeger , Hans-Peter Kriegel, The buddy tree: an efficient and robust access method for spatial data base, Proceedings of the sixteenth international conference on Very large databases, p.590-601, September 1990, Brisbane, Australia
	10	Scott T. Leutenegger, Jeffrey M. Edington, and Mario A. Lopez. STR: A simple and efficient algorithm for R-Tree packing. Technical Report 96-02, Mathematics and Computer Science Dept., University of Denver, 1996.
	11	Ketan Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice- Hall, Simon and Schuster Company at Englewood Cliffs, NJ, 1994.
	12	J. Nievergelt , H. Hinterberger , K. C. Sevcik, The grid file: an adaptable, symmetric multikey file structure, Readings in database systems, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1988
	13	Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
	14	John T. Robinson, The K-D-B-tree: a search structure for large multidimensional dynamic indexes, Proceedings of the 1981 ACM SIGMOD international conference on Management of data, April 29-May 01, 1981, Ann Arbor, Michigan [doi>10.1145/582318.582321]
	15	Timos K. Sellis , Nick Roussopoulos , Christos Faloutsos, The R+-Tree: A Dynamic Index for Multi-Dimensional Objects, Proceedings of the 13th International Conference on Very Large Data Bases, p.507-518, September 01-04, 1987

CITED BY 14

	S. Sioutas , L. Drossos , D. Tsolis , T. S. Papatheodorou, Embedding advanced geometric techniques into SQL for efficient indexing of mobile objects, Proceedings of the 5th WSEAS International Conference on Applied Informatics and Communications, p.348-356, September 15-17, 2005, Malta
	Yufei Tao , Dimitris Papadias , Xiang Lian , Xiaokui Xiao, Multidimensional reverse kNN search, The VLDB Journal — The International Journal on Very Large Data Bases, v.16 n.3, p.293-316, July 2007
	Simonas Šaltenis , Christian S. Jensen , Scott T. Leutenegger , Mario A. Lopez, Indexing the positions of continuously moving objects, ACM SIGMOD Record, v.29 n.2, p.331-342, June 2000
	Yufei Tao , Dimitris Papadias , Xiang Lian, Reverse kNN search in arbitrary dimensionality, Proceedings of the Thirtieth international conference on Very large data bases, p.744-755, August 31-September 03, 2004, Toronto, Canada
	Yuan-Chi Chang , Lawrence Bergman , Vittorio Castelli , Chung-Sheng Li , Ming-Ling Lo , John R. Smith, The onion technique: indexing for linear optimization queries, ACM SIGMOD Record, v.29 n.2, p.391-402, June 2000
	Haifeng Yu , Amin Vahdat, Efficient Numerical Error Bounding for Replicated Network Services, Proceedings of the 26th International Conference on Very Large Data Bases, p.123-133, September 10-14, 2000
	Khaled Elbassioni , Amr Elmasry , Ibrahim Kamel, An Indexing Method for Answering Queries on Moving Objects, Distributed and Parallel Databases, v.17 n.3, p.215-249, March 2005
	Dong Xin , Chen Chen , Jiawei Han, Towards robust indexing for ranked queries, Proceedings of the 32nd international conference on Very large data bases, September 12-15, 2006, Seoul, Korea
	Reynold Cheng , Yuni Xia , Sunil Prabhakar , Rahul Shah , Jeffrey Scott Vitter, Efficient indexing methods for probabilistic threshold queries over uncertain data, Proceedings of the Thirtieth international conference on Very large data bases, p.876-887, August 31-September 03, 2004, Toronto, Canada
	Dong Xin , Jiawei Han , Hong Cheng , Xiaolei Li, Answering top-k queries with multi-dimensional selections: the ranking cube approach, Proceedings of the 32nd international conference on Very large data bases, September 12-15, 2006, Seoul, Korea
	Michael Morse , Jignesh M. Patel , William I. Grosky, Efficient evaluation of radial queries using the target tree, International Journal of Bioinformatics Research and Applications, v.3 n.1, p.24-41, December 2007
	George Kollios , Dimitrios Gunopulos , Vassilis J. Tsotras, On indexing mobile objects, Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.261-272, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
	George Kollios , Dimitris Papadopoulos , Dimitrios Gunopulos , J. Tsotras, Indexing mobile objects using dual transformations, The VLDB Journal — The International Journal on Very Large Data Bases, v.14 n.2, p.238-256, April 2005
	Pankaj K. Agarwal , Lars Arge , Jeff Erickson , Paolo G. Franciosa , Jeffry Scott Vitter, Efficient searching with linear constraints, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.169-178, June 01-04, 1998, Seattle, Washington, United States