LSH ensemble
Authors:
Top Cited Papers
Open Access
- 1 August 2016
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 9 (12) , 1185-1196
Abstract
We study the problem of domain search where a domain is a set of distinct values from an unspecified universe. We use Jaccard set containment score, defined as | Q ∩ X |/| Q |, as the measure of relevance of a domain X to a query domain Q . Our choice of Jaccard set containment over Jaccard similarity as a measure of relevance makes our work particularly suitable for searching Open Data and data on the web, as Jaccard similarity is known to have poor performance over sets with large differences in their domain sizes. We demonstrate that the domains found in several real-life Open Data and web data repositories show a power-law distribution over their domain sizes. We present a new index structure, Locality Sensitive Hashing (LSH) Ensemble, that solves the domain search problem using set containment at Internet scale. Our index structure and search algorithm cope with the data volume and skew by means of data sketches using Minwise Hashing and domain partitioning. Our index structure does not assume a prescribed set of data values. We construct a cost model that describes the accuracy of LSH Ensemble with any given partitioning. This allows us to formulate the data partitioning for LSH Ensemble as an optimization problem. We prove that there exists an optimal partitioning for any data distribution. Furthermore, for datasets following a power-law distribution, as observed in Open Data and Web data corpora, we show that the optimal partitioning can be approximated using equi-depth, making it particularly efficient to use in practice. We evaluate our algorithm using real data (Canadian Open Data and WDC Web Tables) containing up over 262 million domains. The experiments demonstrate that our index consistently outperforms other leading alternatives in accuracy and performance. The improvements are most dramatic for data with large skew in the domain sizes. Even at 262 million domains, our index sustains query performance with under 3 seconds response time.Keywords
This publication has 21 references indexed in Scilit:
- The Mannheim Search Join EngineJournal of Web Semantics, 2015
- Answering table queries on the web using column keywordsProceedings of the VLDB Endowment, 2012
- InfoGather2012
- Instance-Based Matching of Large Ontologies Using Locality-Sensitive Hashing2012
- Recovering semantics of tables on the webProceedings of the VLDB Endowment, 2011
- Annotating and searching web tables using entities, types and relationshipsProceedings of the VLDB Endowment, 2010
- A survey of top- k query processing techniques in relational database systemsACM Computing Surveys, 2008
- WebTablesProceedings of the VLDB Endowment, 2008
- Near-optimal hashing algorithms for approximate nearest neighbor in high dimensionsCommunications of the ACM, 2008
- LSH forest2005