Hum-a-song: A Subsequence Matching with Gaps-Range-Tolerances Query-By-Humming System
Summary: Hum-a-song casts query-by-humming as 2D (pitch, duration) time-series subsequence matching. Its SMBGT dynamic program supports noise, sequence-dependent gap-range tolerances, variable match lengths, and optional match-count bounds. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Alexios Kotsifakos (University of Texas)
- 2. Panagiotis Papapetrou (Aalto University)
- 3. Jaakko Hollmen (Aalto University)
- 4. Dimitrios Gunopulos (University of Athens)
- 5. Vassilis Athitsos (University of Texas)
- 6. George Kollios (Boston University)
BibTeX Citation
@article{kotsifakos_vldb12,
title = {{Hum-a-song: A Subsequence Matching with Gaps-Range-Tolerances Query-By-Humming System}},
author = {Kotsifakos, Alexios and Papapetrou, Panagiotis and Hollmen, Jaakko and Gunopulos, Dimitrios and Athitsos, Vassilis and Kollios, George},
journal = {PVLDB},
series = {{VLDB} '12},
volume = {5},
number = {12},
pages = {1930--1933},
doi = {10.14778/2367502.2367534},
url = {https://doi.org/10.14778/2367502.2367534},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,295 | CIVET: Exploring Compact Index for Variable-Length Subsequence Matching on Time Series | 2024 | VLDB | 5.0723324e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,052 | Warping Indexes with Envelope Transforms for Query by Humming | 2003 | SIGMOD | 0.00012388955 |
| 9,619 | A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application | 2011 | VLDB | 5.2308428e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,150 | Anticipatory DTW for Efficient Similarity Search in Time Series Databases | 2009 | VLDB |
| 2 | 8,745 | The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem | 2022 | VLDB |
| 3 | 5,625 | Ranked Subsequence Matching in Time-Series Databases | 2007 | VLDB |
| 4 | 7,727 | Efficient Top-k Algorithms for Approximate Substring Matching | 2013 | SIGMOD |
| 5 | 6,891 | A Generic Framework for Efficient and Effective Subsequence Retrieval | 2012 | VLDB |
| 6 | 3,453 | Approximate Embedding-Based Subsequence Matching of Time Series | 2008 | SIGMOD |
| 7 | 8,387 | SoundCompass: A Practical Query-by-Humming System | 2004 | SIGMOD |
| 8 | 1,052 | Warping Indexes with Envelope Transforms for Query by Humming | 2003 | SIGMOD |
| 9 | 13,979 | Query by Humming - in Action with its Technology Revealed | 2003 | SIGMOD |
| 10 | 9,619 | A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application | 2011 | VLDB |