Size-Estimation Framework with Applications to Transitive Closure and Reachability

Journal of Computer and System Sciences

Volumn 55, Issue 3, 1997, Pages 441-453

  Cohen, Edith ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MONTE CARLO METHODS; PROBLEM SOLVING;

REACHABILITY SETS; SIZE ESTIMATION ALGORITHMS; TRANSITIVE CLOSURE ALGORITHMS;

COMPUTATIONAL METHODS;

EID: 0031353179     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1534     Document Type: Article

References (24)

1. A. Aggarwal, R. Anderson, and M.-Y. Kao, Parallel depth-first-search in general directed graphs, SIAM J. Comput. 19 (1990), 397-409.
2. P. J. Bickel and K. A. Doksum, "Mathematical Statistics," Prentice-Hall, Englewood Cliffs, NJ, 1977.
3. P. Billingsley, "Probability and measure," John Wiley & Sons, New York, 1986.
4. H. Chernoff, A measure of the asymptotic efficiency for test of a hypothesis based on the sum of observations, Ann. Math. Statist. 23 (1952), 493-509.
5. E. Cohen, Optimizing multiplications of sparse matrices, in "Proc. of the 5th International Conference on Integer Programming and Combinatorial Optimization" (W. H. Cunningham, S. T. McCormick, and M. Queyranne, Eds.), pp. 219-233, Lecture Notes in Computer Science Vol. 1084, Springer-Verlag, New York, 1996.
6. E. Cohen, Y.-M. Wang, and G. Suri, When piecewise determinism is almost true, in "Proc. Pacific Rim International Symposium on Fault-Tolerant Systems, December 1995," pp. 66-71.
7. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbol. Comput. 9 (1990), 251-280.
8. T. Corman, C. Leiserson, and R. Rivest, "Introduction to Algorithms," McGraw-Hill, New York, 1990.
9. S. Dar, "Augmenting Databases with Generalized Transitive Closure," Ph.D. thesis, Department of Computer Science, University of Wisconsin, Madison, 1994.
10. W. Feller, "An introduction to Probability Theory and Its Applications," Vol. 1, Wiley, New York, 1968.
11. W. Feller, "An Introduction to Probability Theory and Its Applications," Vol. 2, Wiley, New York, 1971.
12. S. Guaterry and G. Miller, A contraction procedure for planar directed graphs, in "Proc. 4th annual ACM Symposium on Parallel Algorithms and Architectures 1992," pp. 431-441.
13. H. Jakobsson, Mixed-approach algorithms for transitive closure, in "Proc. of the 10th ACM SIGACT-SIGMOND-SIGART Symposium on Principles of Database Systems, 1991," pp. 199-205.
14. H. Jakobsson, On tree-based techniques for query evaluation, in "Proc. of the 11th ACM SIGACT-SIGMOND-SIGART Symposium on Principles of Database Systems, 1992," pp. 380-392.
15. M.-Y. Kao and P. N. Klein, Towards overcoming the transitive-closure bottleneck; Efficient parallel algorithms for planar digraphs, J. Comput. System Sci. 47 (1993), 459-500.
16. D. R. Karger, "Random Sampling in Graph Optimization Problems," Ph.D. thesis, Stanford University, 1994 available by ftp from theory. stanford.edu, directory pub/karger.
17. J. C. Kiefer, "Introduction to Statistical Inference," Springer-Verlag, New York, 1987.
18. P. N. Klein and S. Sairam, A linear-processor polylog-time algorithm for shortest paths in planar graphs, in "Proc. 34th IEEE Annual Symposium on Foundations of Computer Science, 1993," pp. 259-270.
19. D. E. Knuth, "The art of computer programming," Vol. 3, Addison-Wesley Publishing Co., Reading, MA, 1973.
20. R. J. Lipton and J. F. Naughton, Estimating the size of generalized transitive closures, in "Proc. of the 15th Int. Conference on Very Large Databases, 1989," pp. 165-172.
21. R. J. Lipton and J. F. Naughton, Query size estimation by adaptive sampling, in "Proc. of the 9th ACM SIGACT-SIGMOND-SIGART Symposium on Principles of Database Systems, 1990," pp. 40-46.
22. R. J. Lipton, J. F. Naughton, and D. A. Schneider, Practical selectivity estimation through adaptive sampling, in "Proc. of the 1990 ACM SIGMOND Int. Conference on Management of Data, 1990," pp. 1-11.
23. J. D. Ullman and M. Yannakakis, High-probability parallel transitive closure algorithms, SIAM J. Comput. 20 (1991), 100-125.
24. M. Yannakakis, Graph-theoretic methods in database theory, in "Proc. of the 9th ACM SIGACT-SIGMOND-SIGART Symposium on Principles of Database Systems, 1990," pp. 230-242.