Efficient exact set similarity joins

Details Efficient exact set similarity joins Efficient exact set similarity joins

2011-01-04

2011-01-04

Mofiz, Apu M (Department: 2161)

Data processing: database and file management or data structures

Database and file access

Query optimization

C707S713000, C707S714000

Reexamination Certificate

active

07865505

ABSTRACT:
A machine implemented system and method that efficiently facilitates and effectuates exact similarity joins between collections of sets. The system and method obtains a collection of sets and a threshold value from an interface, and based at least in part on an identifiable similarity, such as an overlap or intersection, between the collection of sets the analysis component generates and outputs a candidate pair that at least equals or exceeds the threshold value.

REFERENCES:
patent: 2004/0093320 (2004-05-01), Shin
patent: 2005/0086224 (2005-04-01), Franciosa et al.
Sarawagi, Sunita et al, “Efficient set joins on similarity predicates”, Jun. 13, 2004, ACM, pp. 743-754 (1 through 12).
Arasu, et al. “Efficient Exact Set-Similarity Joins” (2006) ACM, 12 pages.

Affiliated with

Also associated with

Rating

Efficient exact set similarity joins does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient exact set similarity joins, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient exact set similarity joins will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2729606