Sciweavers

2514 search results - page 323 / 503
» On the Computation of Approximations of Database Queries
Sort
View
WIDM
2004
ACM
16 years 6 days ago
A comprehensive solution to the XML-to-relational mapping problem
The use of relational database management systems (RDBMSs) to store and query XML data has attracted considerable interest with a view to leveraging their powerful and reliable da...
Sihem Amer-Yahia, Fang Du, Juliana Freire
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
15 years 11 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
EDBT
2010
ACM
210views Database» more  EDBT 2010»
15 years 8 months ago
Keyword search for data-centric XML collections with long text fields
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Current approaches for supporting such queries are either for textcentric XM...
Arash Termehchy, Marianne Winslett
AAAI
2008
15 years 9 months ago
Factored Models for Probabilistic Modal Logic
Modal logic represents knowledge that agents have about other agents' knowledge. Probabilistic modal logic further captures probabilistic beliefs about probabilistic beliefs....
Afsaneh Shirazi, Eyal Amir
CIKM
2009
Springer
16 years 1 months ago
Frequent subgraph pattern mining on uncertain graph data
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
Zhaonian Zou, Jianzhong Li, Hong Gao, Shuo Zhang