Sciweavers

1675 search results - page 139 / 335
» Implementing Data Cubes Efficiently
Sort
View
VLDB
1989
ACM
105views Database» more  VLDB 1989»
14 years 2 months ago
Monitoring Database Objects
A method is described for actively interfacing an Object-Oriented Database Management System (OODBMS) to application pre grams. The method, called a database monitor, observes how...
Tore Risch
SODA
2004
ACM
173views Algorithms» more  SODA 2004»
13 years 11 months ago
Tabulation based 4-universal hashing with applications to second moment estimation
We show that 4-universal hashing can be implemented efficiently using tabulated 4-universal hashing for characters, gaining a factor of 5 in speed over the fastest existing method...
Mikkel Thorup, Yin Zhang
TDHMS
2008
13 years 10 months ago
Constructing Good Covering Codes for Applications in Steganography
Application of covering codes to data embedding improves embedding efficiency and security of steganographic schemes. In this paper, we describe several familes of covering codes c...
Jürgen Bierbrauer, Jessica J. Fridrich
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
14 years 11 months ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke
WSC
2004
13 years 11 months ago
New Event-driven Sampling Techniques for Network Reliability Estimation
Exactly computing network reliability measures is an NPhard problem. Therefore, Monte Carlo simulation has been frequently used by network designers to obtain accurate estimates. ...
Abdullah Konak, Alice E. Smith, Sadan Kulturel-Kon...