SIGN IN
SIGN UP
Optimal indexing using near-minimal space
Full Text:
PDF
Buy this Article
Authors:
C. Heeren
University of Illinois at Urbana-Champaign, Urbana, IL
H. V. Jagadish
University of Michigan, Ann Arbor, MI
L. Pitt
University of Illinois at Urbana-Champaign, Urbana, IL
Published in:
· Proceeding
PODS '03
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pages 244-251
ACM
New York, NY
, USA
©2003
table of contents
ISBN:1-58113-670-6
doi>
10.1145/773153.773177
2003 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 22
· Downloads (cumulative): 606
· Citation Count: 2
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGMOD/PODS'13
Share:
|
Tags:
algorithms
analysis of algorithms
error handling and recovery
experimentation
measurement
query processing
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