735 search results - page 19 / 147 » Evaluating Probabilistic Queries over Imprecise Data |
DEBU
2007
14 years 11 months ago
2007
Social network analysis (SNA) has become a mature scientific field over the last 50 years and is now an area with massive commercial appeal and renewed research interest. In thi...
130
click to vote
PODS
2010
ACM
15 years 4 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
WEBDB
2004
Springer
15 years 5 months ago
2004
Springer
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
EDBTW
2010
Springer
15 years 6 months ago
2010
Springer
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
101
click to vote
ICDT
2001
ACM
15 years 4 months ago
2001
ACM
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...