1778 search results - page 64 / 356 » The Theory of Probabilistic Databases |
ICDT
2001
ACM
14 years 1 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...
CIKM
1997
Springer
14 years 1 months ago
1997
Springer
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
— One of the most prominent data quality problems is the existence of duplicate records. Current data cleaning systems usually produce one clean instance (repair) of the input da...
MDM
2009
Springer
14 years 3 months ago
2009
Springer
—A nearest neighbor query is an important notion in spatial databases and moving object databases. In the emerging application fields of moving object technologies, such as mobi...
ICDT
2007
ACM
14 years 3 months ago
2007
ACM
Information integration is becoming a critical problem for businesses and individuals alike. Data volumes are sky-rocketing, and new sources and types of information are proliferat...