Mihalis Yannakakis
- AP.F. Afrati, and C. H. Papadimitriou, "The Parallel Complexity of Simple Chain Queries", Proc. 6th ACM Symp. on Principles of Database Systems, pp. 210-214, 1987. Google Scholar
Digital Library
- AAK.A. Aggaxwal, R. I. Anderson, and M.-Y. Kao, "Parallel Depth-First Search in General Directed Graphs", Proc. 21st ACM Syrup. on Theory of Computing, pp. 297-308. Google ScholarDigital Library
- ACS.A. Aggarwal, A. K. Chandra, and M. Snir, "Hierarchical Memory with Block Transfer", Proc. 28th IEEE Syrup. on Foundations of Computer Science, pp. 204-216, 1987.Google ScholarDigital Library
- A.R. Agrawal, "Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries", Proc. 3rd Intl. Conf. on Data Engineering, pp. 580- 590, 1987. Google ScholarDigital Library
- AJ.R. Agrawal, and H. V. Jagadish, "Direct Algorithms for Computing the Transitive Closure of Database Relations", Proc. Intl. Conf. on Very Large Data Bases, pp. 255-266, 1987. Google ScholarDigital Library
- AHU.A.V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974. Google ScholarDigital Library
- ASU.A.V. Aho, R. Sethi, and J. D. Ullman, Compilers, Principles, Techniques, and Tools, Addison-Wesley, 1986. Google ScholarDigital Library
- AU.A.V. Aho, and J. D. Ullman, "Universality of Data Retrieval Languages", Proc. 6th ACM Syrup. on Principles of Programming Languages, pp. 110-120, 1979. Google ScholarDigital Library
- A+.R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovasz, and C. Rackoff, "Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems", Proc. 20th 1EEE Syrup. on Foundations of Computer Science, pp. 218-223, 1979.Google ScholarDigital Library
- BMSU.F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman, "Magic Sets and Other Strange Ways to Implement Logic Programs", Proc. 6th ACM Syrup. on Principles of Database Systems, pp. 1-15, 1986. Google ScholarDigital Library
- BR.F. Bancilhon, and R. Ramakrishnan, "An Amateur's Introduction to Recursive Query Processing Strategies", Proc, ACM SIGMOD Conf. on Management of Data, pp. 16-52, 1986. Google ScholarDigital Library
- BKBR.C. Beeri, P. C. Kanellakis, F. Bancilhon, and R. Ramakrishnan, "Bounds on the Propagation of Selection into Logic Programs", Proc. 6th ACM Syrup. on Principles of Database Systems, pp. 214-226, 1987. Google ScholarDigital Library
- BR.C. Beeri and R. Ramakrishnan, "On the Power of Magic", Proc. 6th ACM Syrup. on Principles of Database Systems, pp. 269-283, 1987. Google ScholarDigital Library
- BS.J. Biskup, and H, Stiefeling, 'Transitive Closure Algorithms for Very Large Databases", TR, Hochschule Hildesheim, 1988.Google Scholar
- BFM.P.A. Bloniarz, M. J. Fischer, and A. R. Meyer, "A Note on the Average Time to Compute Transitive Closure", Proc. Intl. Coll. on Automata, Languages, and Prograrmning, 1976.Google Scholar
- BKV.A.L. Buchsbaum, P. C. Kanellakis, and J. S. Vitter, "A Data Structure for Arc Insertion and Regular Path Finding", Proc. ACM-SIAM Syrup. on Discrete Algorithms, to appear, 1990. Google ScholarDigital Library
- C.B. Carte, Graphs and Networks, Oxford University Press, 1979.Google Scholar
- CW.D. Coppersmith, and S. Winograd, "Matrix Multiplication via Arithmetic Progressions", Proc. 19th ACM Symp. on Theory of Computing, pp. 1-6, 1987. Google ScholarDigital Library
- CK.S. Cosmadakis, and P. C. Kanellakis, "Parallel Evaluation of Recursive Rule Queries", Proc. 5th ACM Syrup. on Principle of Database Systems, pp. 280-293, 1986. Google ScholarDigital Library
- CMW.I.F. Cruz, A. O. Mendelzon, and P. T. Wood, "A Graphical Query Language Supporting Recursion", Proc. ACM SIGMOD Conf. on Management of Data, pp.323-330, 1987. Google ScholarDigital Library
- DKS.C. Dwork, P. C. Kanellakis, and L. Stockmeyer, "Parallel Algorithms for Term Matching", SIAM J. on Computing, 1988. Google ScholarDigital Library
- FHW.S. Fortune, J. Hopcroft, and J. Wyllie, "The Directed Subgraph Homeomorphism Problem", Theoretical Computer Science, 10, pp. 11-121, 1980.Google ScholarCross Ref
- GM.H. Gazit, and G. L. Miller, "An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph", Information Processing Letters, 28(1), pp. 61-65, 1988. Google ScholarDigital Library
- GS.N. Goodman, and O. Shmueli, "rhe Tree Property is Fundamental for Query Processing", Proc. 1st ACM Syrup. on Principles of Database Systems, pp. 40-48, 1982. Google ScholarDigital Library
- GSS.G. Grahne, S. Sippu, and E. Soisalon-Soininen, "Efficient Evaluation for a Subset of Recursive Queries", Proc. 6th ACM Symp. on Principles of Database Systents, pp. 284-293, 1987. Google ScholarDigital Library
- HaN.R.W. Haddad, and J. F. Naughton, "Counting Methods for Cyclic Relations", Proc. 7th ACM Syrup. on Principles of Database Systems, pp. 333-340, 1988. Google ScholarDigital Library
- HeN.L.J. Henschen, and S. A. Naqvi, "On Compiling Queries in First-Order Databases", J. ACM, 31 (1), pp. 47-85, 1984. Google ScholarDigital Library
- Ho.G.J. Holzman, "An Improved Protocol Reachability Analysis Technique", Software-Practice and Experience, 18(2), pp. 137-161, 1988. Google ScholarDigital Library
- HK.J.W. Hong, and H. T. Kung, 'The Red-Blue Pebble Game", Proc. 13th ACM Syrup. on Theory of Computing, pp. 326-33, 1980. Google ScholarDigital Library
- HSU.H.B. Hunt HI, T. G. Szymanski, and J. D. Ullman, "~ations on Sparse Relations", C. ACM, 20(3), pp. 171-176, 1977. Google ScholarDigital Library
- IK.T. Ibaraki, and N. Katoh, "On-line Computation of Transitive Closure of Graphs", Information Processing Letters, 16(9), pp. 5-7, 1983.Google Scholar
- I.Y.E. Ioannides, "On the Computation of the Transitive Closure of Relational Operators", Proc. Intl. Conf. on Very Large Data Bases, pp. 403-411, 1986. Google ScholarDigital Library
- IR.Y.E. Ioannidis, and R. Ramakrishnan, "Efficient Transitive Closure Algorithms", Proc. 14th Intl. Conf. on Very Large Data Bases, pp. 382-394, 1988. Google ScholarDigital Library
- It1.G.F. Italiano, "Amortized Efficiency of a Path Retrieval Data Structure", Theoretical Computer Science, 48(2), pp. 73-81, 1986. Google ScholarDigital Library
- It2.G.F. Italiano, "Finding Paths and Deleting Edges in Directed Acyclie Graphs", Information Processing Letters, 28(1), pp. 5-11, 1988. Google ScholarDigital Library
- Im.N. Immerman, "Nondeterministic Space is Closed Under Complementation", SlAM J. Computing, 17(5), pp. 935-938, 1988. Google ScholarDigital Library
- JAN.H.V. jagadish, V. R. Agrawal, and L. Ness, "A Study of Transitive Closure as a Recursion Mechanism", Proc. ACM SIGMOD Conf. on Management of Data, pp. 331-344, 1987. Google ScholarDigital Library
- K.P.C. Kanellakis, "Logic Programming and Parallel Complexity", in Foundations of Deductive Databases and Logic Programming, J. Minker, ed., Morgan Kaufmann Publishers, 1987. Google ScholarDigital Library
- KS.M.-Y. Kao, and G. E. Shannon, "Local Orientation, Global Order and Planar Topology", Proc. 21st ACM Syrup. on Theory of Computing, pp. 286-296, 1989. Google ScholarDigital Library
- LN.R.J. Lipton, and J. F. Naughtort, "Estimating the Size of Generalized Transitive Closure", Proc. 15th Intl. Conf. on Very Large Data Bases, pp. 165-1172, 1989. Google ScholarDigital Library
- L.H. Lu, "New Strategies for Computing the Transitive Closure of Database Relations", Proc. 13th Intl. Conf. on Very Large Databases, pp. 267-274, 1987. Google ScholarDigital Library
- MPS.A. Marchetti-Spaccamela, A. Pelaggi, and D. Sacca, "Worst-Case Complexity Analysis of Methods for Logic Query implementation", Proc. 6th ACM Syrup. on Principles of Database Systems, pp. 294-301, 1987. Google ScholarDigital Library
- MC.A.C. McKellar, and E. G. Coffrnan, Jr., "Organizing Matrices and Matrix Operations for Paged Memory Systems", C. ACM, 12(3), pp. 153-165, 1969. Google ScholarDigital Library
- MW.A.O. Mendelzon, and P. T. Wood, "Finding Regular Simple Paths in Graph Databases", Proc. 15th intl. Conf. on Very Large Data Bases, pp. 185-194, 1989. Google ScholarDigital Library
- N.J.F. Naughton, "One-Sided Recursions", Proc. 6th ACM Syrup. on Principles of Database Systems, pp. 340-348, 1987. Google ScholarDigital Library
- NRSU.J.F.Naughton, R. Ramakrishnan, Y. Sagiv, and J. D. Ullman, "Efficient Evaluation of Right-, Left-, and Multi-Linear Rule.s", Proc. ACM SIGMOD Conf. on Management of Data, pp. 235-242, 1989. Google ScholarDigital Library
- RS.N. Robertson, and P. D. Seymour, "Graph Minors XIII: The Disjoint Paths Problem", manuscript, 1986.Google Scholar
- SZ1.D. Sacea, and C. Zaniolo, "Magic Counting Methods", Proc. ACM SIGMOD Intl. Conf. on Management of Data, pp. 49-59, 1987. Google ScholarDigital Library
- SZ2.D. Sac, ca, and C. Zaniolo, "The Generalized Counting Method for Recursive Logic Queries", Theoretical Cong~uter Science, 62, pp. 187-220, 1988. Google ScholarDigital Library
- S.C.P. Schnorr, "An Algorithm for Transitive Closure with Linear Expected Time", SlAM J. Computing, 7(1), pp. 127-133, 1978.Google ScholarDigital Library
- SeV.R. Sedgewick, and J. S. Vitter, "Shortest Paths in Euclidean Graphs", Proc. 25th IEEE Syrup. on Foundations of Computer Science, pp. 417-424, 1984,Google ScholarDigital Library
- SV.Y. Shiloah, and U. Vishkin, "An O(logn) parallel connectivity algorithm", J. Algorithms, 3(1), pp. 57- 63, 1982.Google ScholarCross Ref
- Sh.O. Shmueli, "Dynamic Cycle Detection", Information Processing Letters, 17, pp. 185-188, 1983.Google ScholarCross Ref
- Si.K. Simon, "An Improved Algorithm for Transitive Closure on Acyclie Digraphs", Proc. intl. Conf. on Automata, Languages, and Programming, pp. 376- 386, 1986. Google ScholarDigital Library
- SS1.S. Sippu and E. Soisalon-Soininen, "An Optimization Strategy for Recursive Queries in Logic Data Bases", Proc. 4th Intl. Conf. on Data Engineering, pp. 470- 477, 1988. Google ScholarDigital Library
- SS2.S. Sippu and E. Soisalon-Soininen, "A Generalized Transitive Closure for Relational Queries", Proc. 7th ACM Syrup. on Principles of Database Systems, pp. 325-332, 1988. Google ScholarDigital Library
- Sz.R. Szelepcsenyi, "The Mehtod of Forcing for Nondeterministic Automata", Bulletin EATCS, 33, pp. 96-100, 1987.Google Scholar
- SU.T.G. Szymanski, and J. D. Ullman, "Evaluating Relational Expressions with Dense and Sparse Arguments", SIAM J. on Computing, 6(1), pp. 109-122, 1977.Google ScholarDigital Library
- T1.R.E. Tarjan, "A Unified Approach to Path Problems", J. ACM, 28(3), pp. 577-593, 1981. Google ScholarDigital Library
- T2.R.E. Tarjan, "Fast Algorithms for Solving Path Problems", J. ACM, 28(3), pp.594-614, 1981. Google ScholarDigital Library
- TY.R.E. Tarj~n, and M. Yannakakis, "Simple Linear- Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hepergraphs, and Selectively Reduce Acyclic Hypergraphs", SlAM J. on Computing, 13(3), pp. 566-579, 1984. Google ScholarDigital Library
- To.M. Tompa, "Two Familiar Transitive Closure Algorithms which Admit no Polynomial Time, Sublinear Space Implementations", Proc. 12th ACM Syrup. on Theory of Computing, pp. 333-338, 1980. Google ScholarDigital Library
- U1.J. D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. I: Classical Database Systems, Computer Science Press, 1988. Google ScholarDigital Library
- U2.J. D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. II: The New Technologies, Computer Science Press, 1989. Google ScholarDigital Library
- UV.J.D. Ullman, and A. Van Gelder, "Parallel Complexity of Logical Query Programs", Proc. 27th IEEE Syrup. on Foundation of Computer Science, pp. 438- 454, 1986.Google ScholarDigital Library
- UY1.J.D. Ullman, and M. Yannakakis, "The Input/Output Complexity of Transitive Closure", manuscript, 1989.Google Scholar
- UY2.J.D. Ullman, and M. Yarmakakis, "High-Probability Parallel Transitive Closure Algorithms", manuscript, 1989.Google Scholar
- VK.P. Valduriez, and S. Khoshafian, "Parallel Evaluation of the Transitive Closure of a Database Relation", Intl. J. of Parallel Programming, pp. 19-42, 1988. Google ScholarDigital Library
- V.L.G. Valiant, "General Context-Free Recognition in Less than Cubic Time", J. Computer and System Sc., 10, pp. 308-315, 1975.Google ScholarDigital Library
- W1.H.S. Warren, "A Modification of Warshall's Algorithm for the Transitive Closure of Binary Relations", C. ACM, 18(4), pp. 218-220, 1975. Google ScholarDigital Library
- W2.S. Warhall, "A Theorem on Boolean Matrices", J. ACM, 9(1), pp. 11-12, 1962. Google ScholarDigital Library
- Z.M. Zloof, "Query-by-example: Operations on the Transitive Closure", IBM RC 5526, 1976.Google Scholar
Index Terms
- Graph-theoretic methods in database theory
Recommendations
Database Note: Development of KiBank, a database supporting structure-based drug design
KiBank is a database of inhibition constant (K"i) values with 3D structures of target proteins and chemicals. K"i values were accumulated from peer-reviewed literature searched via PubMed. The 3D structure files of target proteins were originally from ...
A comparison of a graph database and a relational database: a data provenance perspective
ACM SE '10: Proceedings of the 48th Annual Southeast Regional ConferenceRelational databases have been around for many decades and are the database technology of choice for most traditional data-intensive storage and retrieval applications. Retrievals are usually accomplished using SQL, a declarative query language. ...
Prediction of viable circular permutants using a graph theoretic approach
Motivation: In recent years graph-theoretic descriptions have been applied to aid the analysis of a number of complex biological systems. However, such an approach has only just begun to be applied to examine protein structures and the network of ...
Comments