Exact Indexing for Support Vector Machines

Summary: Proposes iKernel, exact index for SVM top-k queries with varying kernel parameters. Kernel-space ranking instability and ordering stability enable pruning; kernel clustering boosts effectiveness; first exact top-k without full data scan (1–5% eval). (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: hf5505c1d3f62f6e8
Venue: SIGMOD
Year: 2011
Pagerank: 4.9793485e-05
Overall Rank: 12,659 | 14.89%
DOI: 10.1145/1989323.1989398

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Hwanjo Yu (Pohang University of Science and Technology)
2. Ilhwan Ko (Pohang University of Science and Technology)
3. Youngdae Kim (Pohang University of Science and Technology)
4. Seungwon Hwang (Pohang University of Science and Technology)
5. Wook-Shin Han (Kyungpook National University)

BibTeX Citation

@inproceedings{yu_sigmod11,
        title = {{Exact Indexing for Support Vector Machines}},
        author = {Yu, Hwanjo and Ko, Ilhwan and Kim, Youngdae and Hwang, Seungwon and Han, Wook-Shin},
        series = {{SIGMOD} '11},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1989323.1989398},
        url = {https://dl.acm.org/doi/10.1145/1989323.1989398},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
5	Optimal Aggregation Algorithms for Middleware [Extended Abstract]	2001	PODS	0.0010679641
56	M-tree: An Efficient Access Method for Similarity Search in Metric Spaces	1997	VLDB	0.00040370171
111	Optimizing Multi-Feature Queries for Image Databases	2000	VLDB	0.00032675259
3,566	Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions	2007	SIGMOD	7.2015969e-05
7,497	Boolean + Ranking: Querying a Database by K-Constrained Optimization	2006	SIGMOD	5.5089205e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	12,784	Skip-and-Prune: Cosine-based Top-K Query Processing for Efficient Context-Sensitive Document Retrieval	2009	SIGMOD
2	1,878	Effectively Learning Spatial Indices	2020	VLDB
3	9,653	Indexing for Keyword Search with Structured Constraints	2023	PODS
4	6,973	A Scalable Index for Top-k Subtree Similarity Queries	2019	SIGMOD
5	8,818	A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases	2006	SIGMOD
6	8,110	Efficient and Tunable Similar Set Retrieval	2001	SIGMOD
7	674	Efficient Similarity Search and Classification via Rank Aggregation	2003	SIGMOD
8	9,400	Adaptive Indexing in High-Dimensional Metric Spaces	2023	VLDB
9	7,394	Efficient and Generic Evaluation of Ranked Queries	2011	SIGMOD
10	7,856	Similarity Search on Bregman Divergence: Towards Non-Metric Indexing	2009	VLDB