NDLI: Efficient Exact Similarity Searches Using Multiple Token Orderings

Content Provider	IEEE Xplore Digital Library
Author	Jongik Kim Hongrae Lee
Copyright Year	2012
Abstract	Similarity searches are essential in many applications including data cleaning and near duplicate detection. Many similarity search algorithms first generate candidate records, and then identify true matches among them. A major focus of those algorithms has been on how to reduce the number of candidate records in the early stage of similarity query processing. One of the most commonly used techniques to reduce the candidate size is the prefix filtering principle, which exploits the document frequency ordering of tokens. In this paper, we propose a novel partitioning technique that considers multiple token orderings based on token co-occurrence statistics. Experimental results show that the proposed technique is effective in reducing the number of candidate records and as a result improves the performance of existing algorithms significantly.
Starting Page	822
Ending Page	833
File Size	724271
Page Count	12
File Format	PDF
ISBN	9781467300421
ISSN	10844627
e-ISBN	9780769547473
DOI	10.1109/ICDE.2012.79
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-04-01
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Partitioning algorithms Indexes Merging Query processing Search problems Cleaning Dictionaries
Content Type	Text
Resource Type	Article
Subject	Signal Processing Information Systems Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient Exact Similarity Searches using Multiple Token Orderings

An Efficient Trie-based Method for Approximate Entity Extraction with Edit-Distance Constraints

A Similarity Search Approach to Solving the Multi-query Problems

Efficient Merging and Filtering Algorithms for Approximate String Searches

An Efficient Graph Indexing Method

The Min-dist Location Selection Query

Parallel Top-K Similarity Join Algorithms Using MapReduce

Efficient Similarity Search over Encrypted Data

PRAGUE: Towards Blending Practical Visual Subgraph Query Formulation and Query Processing

Efficient Exact Similarity Searches Using Multiple Token Orderings

Similar Documents

Efficient Exact Similarity Searches using Multiple Token Orderings

An Efficient Trie-based Method for Approximate Entity Extraction with Edit-Distance Constraints

A Similarity Search Approach to Solving the Multi-query Problems

Efficient Merging and Filtering Algorithms for Approximate String Searches

An Efficient Graph Indexing Method

The Min-dist Location Selection Query

Parallel Top-K Similarity Join Algorithms Using MapReduce

Efficient Similarity Search over Encrypted Data

PRAGUE: Towards Blending Practical Visual Subgraph Query Formulation and Query Processing

Efficient Exact Similarity Searches Using Multiple Token Orderings