ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
The subspace coding method: a new indexing scheme for high-dimensional data
Full text PdfPdf (196 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: 210 - 218  
Year of Publication: 2000
ISBN:1-58113-320-0
Authors
Yasushi Sakurai  NTT Cyber Space Laboratories, 1-1 Hikarinooka, Yokosuka Kanagawa, Japan 239-0847
Masatoshi Yoshikawa  Nara Institute of Science and Technology, 8916-5 Takayama, Ikoma Nara, Japan 630-0101
Shunsuke Uemura  Nara Institute of Science and Technology, 8916-5 Takayama, Ikoma Nara, Japan 630-0101
Haruhiko Kojima  NTT Cyber Solutions Laboratories, 1-1 Hikarinooka, Yokosuka Kanagawa, Japan 239-0847
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): 7,   Downloads (12 Months): 36,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/354756.354821
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
Stefan Berchtold , Christian Böhm , Daniel A. Keim , Hans-Peter Kriegel, A cost model for nearest neighbor search in high-dimensional data space, Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.78-86, May 11-15, 1997, Tucson, Arizona, United States  [doi>10.1145/263661.263671]
 
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
Antonin Guttman, R-trees: a dynamic index structure for spatial searching, Readings in database systems, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1988
 
5
Gisli R. Hjaltason , Hanan Samet, Ranking in Spatial Databases, Proceedings of the 4th International Symposium on Advances in Spatial Databases, p.83-95, August 06-09, 1995
 
6
Ibrahim Kamel , Christos Faloutsos, Hilbert R-tree: An Improved R-tree using Fractals, Proceedings of the 20th International Conference on Very Large Data Bases, p.500-509, September 12-15, 1994
7
Norio Katayama , Shin'ichi Satoh, The SR-tree: an index structure for high-dimensional nearest neighbor queries, Proceedings of the 1997 ACM SIGMOD international conference on Management of data, p.369-380, May 11-15, 1997, Tucson, Arizona, United States
8
Nick Roussopoulos , Stephen Kelley , Frédéric Vincent, Nearest neighbor queries, Proceedings of the 1995 ACM SIGMOD international conference on Management of data, p.71-79, May 22-25, 1995, San Jose, California, United States
 
9
Yasushi Sakurai, Masatoshi Yoshikawa, and Shunsuke Uemura. High-Dimensional Nearest Neighbor Search Based on Virtual Bounding Rectangles. In Proc. of The 5th International Conference of Foundations of Data Organization (FODO'98), pp.258-267, November 1998.
 
10
Roger Weber , Hans-Jörg Schek , Stephen Blott, A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces, Proceedings of the 24rd International Conference on Very Large Data Bases, p.194-205, August 24-27, 1998
 
11
David A. White , Ramesh Jain, Similarity Indexing with the SS-tree, Proceedings of the Twelfth International Conference on Data Engineering, p.516-523, February 26-March 01, 1996

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.1 Content Analysis and Indexing
          Subjects: Indexing methods

Additional Classification:
  E. Data
  E.4 CODING AND INFORMATION THEORY
      Subjects: Data compaction and compression

  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.3 Information Search and Retrieval
          Subjects: Search process; Retrieval models


General Terms:
Design, Experimentation, Management, Measurement, Performance, Theory


Keywords:
R-tree family, high-dimensional data, nearest neighbor queries, spatial access methods, subspace code

Collaborative Colleagues:
Yasushi Sakurai: colleagues
Masatoshi Yoshikawa: colleagues
Shunsuke Uemura: colleagues
Haruhiko Kojima: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player