Results 161 to 170 of about 188 (183)
Some of the next articles are maybe not open access.

Efficient SimRank-Based Similarity Join

ACM Transactions on Database Systems, 2017
Graphs have been widely used to model complex data in many real-world applications. Answering vertex join queries over large graphs is meaningful and interesting, which can benefit friend recommendation in social networks and link prediction, and so on.
Zheng, Weigua   +3 more
openaire   +3 more sources

Document Similarity Self-Join with MapReduce

2010 IEEE International Conference on Data Mining, 2010
Given a collection of objects, the Similarity Self-Join problem requires to discover all those pairs of objects whose similarity is above a user defined threshold. In this paper we focus on document collections, which are characterized by a sparseness that allows effective pruning strategies.
Ranieri Baraglia   +2 more
openaire   +3 more sources

Star-Join

Proceedings of the 21st ACM international conference on Information and knowledge management, 2012
Location-based services have attracted significant attention due to modern mobile phones equipped with GPS devices. These services generate large amounts of spatio-textual data which contain both spatial location and textual descriptions. Since a spatio-textual object may have different representations, possibly because of deviations of GPS or ...
Sitong Liu   +2 more
openaire   +2 more sources

Efficient Metric Indexing for Similarity Search and Similarity Joins

IEEE Transactions on Knowledge and Data Engineering, 2017
Spatial queries including similarity search and similarity joins are useful in many areas, such as multimedia retrieval, data integration, and so on. However, they are not supported well by commercial DBMSs. This may be due to the complex data types involved and the needs for flexible similarity criteria seen in real applications.
Lu Chen 0001   +4 more
openaire   +3 more sources

Quicker Similarity Joins in Metric Spaces

2013
We consider the join operation in metric spaces. Given two sets A and B of objects drawn from some universe $\mathbb U$ , we want to compute the set $A \Join B = \{a,b \in A \times B\;|\;da,b \leq r\}$ efficiently, where $d : \mathbb U \times \mathbb U \to \mathbb R^+$ is a metric distance function and r∈ℝ+ is user supplied query ...
Braithwaite Billy, Fredriksson Kimmo
openaire   +1 more source

String similarity search and join: a survey

Frontiers of Computer Science, 2015
String similarity search and join are two important operations in data cleaning and integration, which extend traditional exact search and exact join operations in databases by tolerating the errors and inconsistencies in the data. They have many real-world applications, such as spell checking, duplicate detection, entity resolution, and webpage ...
Minghe Yu 0001   +3 more
openaire   +2 more sources

Exploiting MapReduce-based similarity joins

Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, 2012
Cloud enabled systems have become a crucial component to efficiently process and analyze massive amounts of data. One of the key data processing and analysis operations is the Similarity Join, which retrieves all data pairs whose distances are smaller than a pre-defined threshold ∈.
Yasin N. Silva, Jason M. Reed
openaire   +2 more sources

Performance Enhanced Multiset Similarity Joins

2016 IEEE International Conferences on Big Data and Cloud Computing (BDCloud), Social Computing and Networking (SocialCom), Sustainable Computing and Communications (SustainCom) (BDCloud-SocialCom-SustainCom), 2016
The amount of data produced on a daily basis isgrowing at an exponential rate. One method of filtering throughthis data is the use of similarity joins, or methods that areused to identify similar data. Such algorithms are used fora variety of applications ranging from plagiarism detection tomarketing.
Jahnavi Yalamanchili   +3 more
openaire   +2 more sources

String Similarity Join with Different Thresholds

2015
String similarity join is an essential operation of many applications that need to find all similar string pairs from given two collections. The existing approaches are using the uniform and predefined similarity thresholds. While in real applications, regarding that the longer string pairs typically tolerate many more typos, it is necessary to apply ...
Chuitian Rong, Xiangling Zhang
openaire   +1 more source

Trie-based similarity search and join

Proceedings of the Joint EDBT/ICDT 2013 Workshops, 2013
Driven by the increasing demands from applications such as data cleansing, integration, and bioinformatics, approximate string matching queries have gain much attention recently. In this paper, we present the design and implementation of a trie-based system which supports both string similarity search and join based on our recent work [23].
Jianbin Qin   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy