Sciweavers

734 search results - page 15 / 147
» Efficient join processing over uncertain data
Sort
View
177
Voted
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
15 years 11 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
112
Voted
EDBT
2004
ACM
174views Database» more  EDBT 2004»
15 years 9 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
15 years 9 months ago
Optimizing mpf queries: decision support and probabilistic inference
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
Héctor Corrada Bravo, Raghu Ramakrishnan
ICSOC
2010
Springer
14 years 7 months ago
Panta Rhei: Optimized and Ranked Data Processing over Heterogeneous Sources
In the era of digital information, the value of data resides not only in its volume and quality, but also in the additional information that can be inferred from the combination (a...
Daniele Braga, Francesco Corcoglioniti, Michael Gr...
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
15 years 11 months ago
Approximate Joins for Data-Centric XML
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
Nikolaus Augsten, Michael H. Böhlen, Curtis E...