Sciweavers

1768 search results - page 262 / 354
» Mining Very Large Databases
Sort
View
CIKM
1997
Springer
15 years 6 months ago
Learning Belief Networks from Data: An Information Theory Based Approach
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...
Jie Cheng, David A. Bell, Weiru Liu
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
15 years 6 months ago
Implementing Data Cubes Efficiently
Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data ...
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ull...
ICICS
2007
Springer
15 years 6 months ago
Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
Authentication is increasingly relevant to data management. Data is being outsourced to untrusted servers and clients want to securely update and query their data. For example, in ...
Charalampos Papamanthou, Roberto Tamassia
ICDT
1995
ACM
79views Database» more  ICDT 1995»
15 years 6 months ago
Optimization Using Tuple Subsumption
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
Venky Harinarayan, Ashish Gupta
DEXA
2006
Springer
151views Database» more  DEXA 2006»
15 years 4 months ago
An Incremental Refining Spatial Join Algorithm for Estimating Query Results in GIS
Geographic information systems (GIS) must support large georeferenced data sets. Due to the size of these data sets finding exact answers to spatial queries can be very time consum...
Wan D. Bae, Shayma Alkobaisi, Scott T. Leutenegger