This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
The traditional statistical assumption for interpreting histograms and justifying approximate query processing methods based on them is that all elements in a bucket have the same...
Although data stored in XML is of increasing importance, most existing data repositories are still managed by relational database systems. In light of this, recent XML database re...
William M. Shui, Franky Lam, Damien K. Fisher, Ray...
Abstract. In this paper, we discuss the XEDY system for storing DTDconscious XML data in a standard relational databases management system. For this, we propose a database schema f...
Sourav S. Bhowmick, Tay Khim Wee, Erwin Leonardi, ...