Sciweavers

2100 search results - page 351 / 420
» Fundamentals of the problem
Sort
View
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
14 years 10 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
ICDT
2009
ACM
149views Database» more  ICDT 2009»
14 years 9 months ago
Query languages for data exchange: beyond unions of conjunctive queries
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
Juan Reutter, Marcelo Arenas, Pablo Barceló
PODS
2009
ACM
136views Database» more  PODS 2009»
14 years 9 months ago
Distributed XML design
A distributed XML document is an XML document that spans several machines or Web repositories. We assume that a distribution design of the document tree is given, providing an XML...
Serge Abiteboul, Georg Gottlob, Marco Manna
PODS
2009
ACM
112views Database» more  PODS 2009»
14 years 9 months ago
Optimal sampling from sliding windows
APPEARED IN ACM PODS-2009. A sliding windows model is an important case of the streaming model, where only the most "recent" elements remain active and the rest are disc...
Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniol...
VLDB
2004
ACM
112views Database» more  VLDB 2004»
14 years 9 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...