SIGN IN
SIGN UP
A new approach for processing ranked subsequence matching based on ranked union
Full Text:
PDF
Buy this Article
Authors:
Wook-Shin Han
Kyungpook National University, Daegu, South Korea
Jinsoo Lee
Kyungpook National University, Deagu, South Korea
Yang-Sae Moon
Kangwon National University, Chuncheon, South Korea
Seung-won Hwang
Pohang University of Science and Technology, Pohang, South Korea
Hwanjo Yu
Pohang University of Science and Technology, Pohang, South Korea
2011 Article
Bibliometrics
· Downloads (6 Weeks): 13
· Downloads (12 Months): 128
· Downloads (cumulative): 349
· Citation Count: 3
Published in:
· Proceeding
SIGMOD '11
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Pages 457-468
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0661-4
doi>
10.1145/1989323.1989371
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
indexing methods
performance
ranked subsequence matching
ranked union
search process
time-series data
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