Sciweavers

193 search results - page 15 / 39
» Matching large schemas: Approaches and evaluation
Sort
View
SIGIR
2010
ACM
13 years 3 months ago
Efficient partial-duplicate detection based on sequence matching
With the ever-increasing growth of the Internet, numerous copies of documents become serious problem for search engine, opinion mining and many other web applications. Since parti...
Qi Zhang, Yue Zhang, Haomin Yu, Xuanjing Huang
SIGMOD
2008
ACM
101views Database» more  SIGMOD 2008»
14 years 9 months ago
Pay-as-you-go user feedback for dataspace systems
A primary challenge to large-scale data integration is creating semantic equivalences between elements from different data sources that correspond to the same real-world entity or...
Shawn R. Jeffery, Michael J. Franklin, Alon Y. Hal...
INFOCOM
2008
IEEE
14 years 3 months ago
HyperCBR: Large-Scale Content-Based Routing in a Multidimensional Space
Abstract—Content-based routing (CBR) is becoming increasingly popular as a building block for distributed applications. CBR differs from classical routing paradigms as messages a...
Stefano Castelli, Paolo Costa, Gian Pietro Picco
SIGMOD
2010
ACM
213views Database» more  SIGMOD 2010»
14 years 1 months ago
On active learning of record matching packages
We consider the problem of learning a record matching package (classifier) in an active learning setting. In active learning, the learning algorithm picks the set of examples to ...
Arvind Arasu, Michaela Götz, Raghav Kaushik
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
14 years 10 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...