Sciweavers

311 search results - page 14 / 63
» Approximate XML joins
Sort
View
COLING
2010
14 years 6 months ago
Simple and Efficient Algorithm for Approximate Dictionary Matching
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
Naoaki Okazaki, Jun-ichi Tsujii
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
15 years 1 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
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 ...
PODS
2005
ACM
115views Database» more  PODS 2005»
15 years 11 months ago
Histograms revisited: when are histograms the best approximation method for aggregates over joins?
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...
Alin Dobra
ADC
2005
Springer
97views Database» more  ADC 2005»
15 years 5 months ago
Querying and Maintaining Ordered XML Data using Relational Databases
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...
ECWEB
2003
Springer
141views ECommerce» more  ECWEB 2003»
15 years 4 months ago
Storing DTD-Conscious XML Data in XEDY
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, ...