Object and query transformation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Object and query transformation: supporting multi-dimensional queries through code reuse

Full text

Pdf (223 KB)

Source

Conference on Information and Knowledge Management archive
Proceedings of the ninth international conference on Information and knowledge management table of contents

McLean, Virginia, United States

Pages: 141 - 149

Year of Publication: 2000

ISBN:1-58113-320-0

Authors

Byunggu Yu	University of Wyoming, Department of Computer Science, PO Box 3682, Laramie, WY
Ratko Orlandic	Illinois Institute of Technology, Department of Computer Science, 10 West 31st Street, Chicago, IL

Sponsors

SIGMIS: ACM Special Interest Group on Management Information Systems
SIGIR: ACM Special Interest Group on Information Retrieval

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 24, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/354756.354812 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	Jon Louis Bentley , Jerome H. Friedman, Data Structures for Range Searching, ACM Computing Surveys (CSUR), v.11 n.4, p.397-409, Dec. 1979 [doi>10.1145/356789.356797]
	3	Stefan Berchtold , Daniel A. Keim , Hans-Peter Kriegel, The X-tree: An Index Structure for High-Dimensional Data, Proceedings of the 22th International Conference on Very Large Data Bases, p.28-39, September 03-06, 1996
	4	Stefan Berchtold , Christian Böhm , Hans-Peter Kriegal, The pyramid-technique: towards breaking the curse of dimensionality, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.142-153, June 01-04, 1998, Seattle, Washington, United States
	5	Kaushik Chakrabarti , Sharad Mehrotra, Efficient concurrency control in multidimensional access methods, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.25-36, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
	6	Douglas Comer, Ubiquitous B-Tree, ACM Computing Surveys (CSUR), v.11 n.2, p.121-137, June 1979 [doi>10.1145/356770.356776]
	7	Christos Faloutsos , Yi Rong, DOT: A Spatial Access Method Using Fractals, Proceedings of the Seventh International Conference on Data Engineering, p.152-159, April 08-12, 1991
	8	C. Faloutsos , R. Barber , M. Flickner , J. Hafner , W. Niblack , D. Petkovic , W. Equitz, Efficient and effective querying by image content, Journal of Intelligent Information Systems, v.3 n.3-4, p.231-262, July 1994 [doi>10.1007/BF00962238]
	9	Michael Freeston, A general solution of the n-dimensional B-tree problem, Proceedings of the 1995 ACM SIGMOD international conference on Management of data, p.80-91, May 22-25, 1995, San Jose, California, United States
	10	Alex A. Freitas , S. H. Lavington, Mining Very Large Databases with Parallel Processing, Kluwer Academic Publishers, Norwell, MA, 1997
	11	Volker Gaede , Oliver Günther, Multidimensional access methods, ACM Computing Surveys (CSUR), v.30 n.2, p.170-231, June 1998 [doi>10.1145/280277.280279]
	12	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
	13	Joseph M. Hellerstein , Jeffrey F. Naughton , Avi Pfeffer, Generalized Search Trees for Database Systems, Proceedings of the 21th International Conference on Very Large Data Bases, p.562-573, September 11-15, 1995
	14	A. Henrich , H. -W. Six , P. Widmayer, The LSD tree: spatial access to multidimensional and non-point objects, Proceedings of the 15th international conference on Very large data bases, p.45-53, July 1989, Amsterdam, The Netherlands
	15	H. V. Jagadish, Linear clustering of objects with multiple attributes, Proceedings of the 1990 ACM SIGMOD international conference on Management of data, p.332-342, May 23-26, 1990, Atlantic City, New Jersey, United States
	16	Marcel Kornacker , C. Mohan , Joseph M. Hellerstein, Concurrency and recovery in generalized search trees, Proceedings of the 1997 ACM SIGMOD international conference on Management of data, p.62-72, May 11-15, 1997, Tucson, Arizona, United States
	17	Philip L. Lehman , s. Bing Yao, Efficient locking for concurrent operations on B-trees, ACM Transactions on Database Systems (TODS), v.6 n.4, p.650-670, Dec. 1981 [doi>10.1145/319628.319663]
	18	C. Mohan , Don Haderle , Bruce Lindsay , Hamid Pirahesh , Peter Schwarz, ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging, ACM Transactions on Database Systems (TODS), v.17 n.1, p.94-162, March 1992 [doi>10.1145/128765.128770]
	19	C. Mohan , Frank Levine, ARIES/IM: an efficient and high concurrency index management method using write-ahead logging, Proceedings of the 1992 ACM SIGMOD international conference on Management of data, p.371-380, June 02-05, 1992, San Diego, California, United States
	20	C. Mohan , Don Haderle, Algorithms for flexible space management in transaction systems supporting fine-granularity locking, Proceedings of the 4th international conference on extending database technology on Advances in database technology, p.131-144, May 1994, Cambridge, United Kingdom
	21	J. A. Orenstein , T. H. Merrett, A class of data structures for associative searching, Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems, April 02-04, 1984, Waterloo, Ontario, Canada [doi>10.1145/588011.588037]
	22	Ratko Orlandic , John L. Pfaltz, Compact 0-Complete Trees, Proceedings of the 14th International Conference on Very Large Data Bases, p.372-381, August 29-September 01, 1988
	23	Ratko Orlandic , Byunggu Yu, A Study of MBR-Based Spatial Access Methods: How Well They Perform in High-Dimensional Spaces, Proceedings of the 2000 International Symposium on Database Engineering & Applications, p.306-318, September 18-20, 2000
	24	Orlandic, R. and Yu, B. "Comparative Analysis of a Spatial Access Method for High-Dimensional Data," 2000 (in review).
	25	Bernd-Uwe Pagel , Hans-Werner Six , Heinrich Toben, The Transformation Technique for Spatial Objects Revisited, Proceedings of the Third International Symposium on Advances in Spatial Databases, p.73-88, June 23-25, 1993
	26	Dimitris Papadias , Timos Sellis , Yannis Theodoridis , Max J. Egenhofer, Topological relations in the world of minimum bounding rectangles: a study with R-trees, Proceedings of the 1995 ACM SIGMOD international conference on Management of data, p.92-103, May 22-25, 1995, San Jose, California, United States
	27	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]
	28	Bernhard Seeger, Performance Comparison of Segment Access Methods Implemented on Top of the Buddy-Tree, Proceedings of the Second International Symposium on Advances in Spatial Databases, p.277-296, August 28-30, 1991
	29	Bernhard Seeger , Hans-Peter Kriegel, Techniques for Design and Implementation of Efficient Spatial Access Methods, Proceedings of the 14th International Conference on Very Large Data Bases, p.360-371, August 29-September 01, 1988
	30	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
	31	Byunggu Yu , Ratko Orlandic , Martha Evens, Simple QSF-trees: an efficient and scalable spatial access method, Proceedings of the eighth international conference on Information and knowledge management, p.5-14, November 02-06, 1999, Kansas City, Missouri, United States [doi>10.1145/319950.319953]
	32	Byunggu Yu , Ratko Orlandic, A family of scalable spatial access methods for high-dimensional data, 2000