Locality preserving dictionaries

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Locality preserving dictionaries: theory & application to clustering in databases

Full text

Pdf (1.09 MB)

Source

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

Philadelphia, Pennsylvania, United States

Pages: 337 - 345

Year of Publication: 1999

ISBN:1-58113-062-7

Author

Vijayshankar Raman

CS Division, UC Berkeley, Berkeley, CA

Sponsors

SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 23, Citation Count: 6

Additional Information:

references cited by 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/303976.304009 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.

	BBK98	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
	CLR90	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	DNO98	S. Dasgupta, A. Nayak, and R. Ostrovsky. Personal Communication, 1998.
	GG97	Jim Gray , Goetz Graefe, The five-minute rule ten years later, and other computer storage rules of thumb, ACM SIGMOD Record, v.26 n.4, p.63-68, Dec. 1997 [doi>10.1145/271074.271094]
	GK97	G. Ganger and M. Kaashoek. Embedded Inodes and explicit grouping: exploiting disk bandwidth for small files. In USENIX Technical Conference, 1997.
	HS66	F. C. Hennie , R. E. Stearns, Two-Tape Simulation of Multitape Turing Machines, Journal of the ACM (JACM), v.13 n.4, p.533-546, Oct. 1966 [doi>10.1145/321356.321362]
	IMRV97	Piotr Indyk , Rajeev Motwani , Prabhakar Raghavan , Santosh Vempala, Locality-preserving hashing in multidimensional spaces, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.618-625, May 04-06, 1997, El Paso, Texas, United States [doi>10.1145/258533.258656]
	Jag97	H. V. Jagadish, Analysis of the Hilbert curve for representing two-dimensional space, Information Processing Letters, v.62 n.1, p.17-22, April 14, 1997 [doi>10.1016/S0020-0190(97)00014-8]
	JS94	T. Johnson and D. Shasha. Utilization of B- Trees with inserts, deletes and modifies. In A CM SIGA CT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1994.
	LS96	Nathan Linial , Ori Sasson, Non-expansive hashing, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.509-518, May 22-24, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/237814.237999]
	PK98	D. Patterson and K. Keeton. Hardware technology trends and database oppotunities. In A CM- SIGMOD International Conference on Management of Data, 1998. Keynote address.
	RvIG98	E. Riedel, C. van Ingen, and J. Gray. A performance study of sequential I/O on Windows NT 4. In USEN{X Windows NT Symposium, 1998.
	Yao78	A. Yao. On random 2-3 trees. In Acta {nformatica, 1978.
	ZS96	Chendong Zou , Betty Salzberg, On-line reorganization of sparsely-populated B+-trees, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.115-124, June 04-06, 1996, Montreal, Quebec, Canada

CITED BY 6

	Changzhou Wang , X. Sean Wang, Supporting subseries nearest neighbor search via approximation, Proceedings of the ninth international conference on Information and knowledge management, p.314-321, November 06-11, 2000, McLean, Virginia, United States
	Michael A. Bender , Ziyang Duan , John Iacono , Jing Wu, A locality-preserving cache-oblivious dynamic dictionary, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.29-38, January 06-08, 2002, San Francisco, California
	Michael A. Bender , Ziyang Duan , John Iacono , Jing Wu, A locality-preserving cache-oblivious dynamic dictionary, Journal of Algorithms, v.53 n.2, p.115-136, November 2004
	Michael A. Bender , Haodong Hu, An adaptive packed-memory array, Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 26-28, 2006, Chicago, IL, USA
	Michael A. Bender , Haodong Hu, An adaptive packed-memory array, ACM Transactions on Database Systems (TODS), v.32 n.4, p.26-es, November 2007
	Djamal Belazzougui , Paolo Boldi , Rasmus Pagh , Sebastiano Vigna, Monotone minimal perfect hashing: searching a sorted table with O(1) accesses, Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, p.785-794, January 04-06, 2009, New York, New York