SIGN IN
SIGN UP
Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach
Full Text:
PDF
Buy this Article
Authors:
Gang Qian
University of Central Oklahoma, Edmond, OK
Qiang Zhu
The University of Michigan---Dearborn, Dearborn, MI
Qiang Xue
Michigan State University, East Lansing, MI
Sakti Pramanik
Michigan State University, East Lansing, MI
2006 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 41
· Downloads (cumulative): 974
· Citation Count: 6
Published in:
· Journal
ACM Transactions on Database Systems (TODS)
TODS Homepage
archive
Volume 31 Issue 2, June 2006
Pages 439-484
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1138394.1138395
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
access methods
algorithms
hamming distance
multidimensional index tree
non-ordered discrete data spaces
performance
similarity search
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder