SIGN IN
SIGN UP
Durable top-k search in document archives
Full Text:
PDF
Buy this Article
Authors:
Leong Hou U
University of Hong Kong, Hong Kong, Hong Kong
Nikos Mamoulis
University of Hong Kong, Hong Kong, Hong Kong
Klaus Berberich
Max-Planck Institute for Informatics, Saarbrücken, Germany
Srikanta Bedathur
Max-Planck Institute for Informatics, Saarbrücken, Germany
2010 Article
Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 64
· Downloads (cumulative): 361
· Citation Count: 5
Published in:
· Proceeding
SIGMOD '10
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Pages 555-566
ACM
New York, NY
, USA
©2010
table of contents
ISBN: 978-1-4503-0032-2
doi>
10.1145/1807167.1807228
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
document archives
experimentation
information search and retrieval
temporal queries
top-k search
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