Sciweavers

3360 search results - page 305 / 672
» Opportunistic Data Structures with Applications
Sort
View
ICDM
2006
IEEE
164views Data Mining» more  ICDM 2006»
15 years 11 months ago
Unsupervised Learning of Tree Alignment Models for Information Extraction
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
Philip Zigoris, Damian Eads, Yi Zhang
IS
2006
15 years 5 months ago
The Michigan benchmark: towards XML query performance diagnostics
We propose a micro-benchmark for XML data management to aid engineers in designing improved XML processing engines. This benchmark is inherently different from application-level b...
Kanda Runapongsa, Jignesh M. Patel, H. V. Jagadish...
PVLDB
2010
195views more  PVLDB 2010»
14 years 11 months ago
Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
Jiannan Wang, Guoliang Li, Jianhua Feng
145
Voted
CSB
2005
IEEE
125views Bioinformatics» more  CSB 2005»
15 years 10 months ago
On Optimizing Distance-Based Similarity Search for Biological Databases
Similarity search leveraging distance-based index structures is increasingly being used for both multimedia and biological database applications. We consider distance-based indexi...
Rui Mao, Weijia Xu, Smriti R. Ramakrishnan, Glen N...
INEX
2009
Springer
15 years 9 months ago
Overview of the INEX 2009 Interactive Track
In the paper we present the organization of the INEX 2009 interactive track. For the 2009 experiments the iTrack has gathered data on user search behavior in a collection consistin...
Nils Pharo, Ragnar Nordlie, Norbert Fuhr, Thomas B...