Yannis E. Ioannidis :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
H. V. Jagadish :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Which papers of H. V. Jagadish cite Yannis E. Ioannidis Ordered by citing publication [Change the order to 'ordered by cited' ]
Rakesh Agrawal , H. V. Jagadish Materialization and Incremental Update of Path Information. [Citation Graph (9, 14)][DBLP ] ICDE, 1989, pp:374-383 [Conf ] Cites:
Shaul Dar , Rakesh Agrawal , H. V. Jagadish Optimization of Generalized Transitive Closure Queries. [Citation Graph (5, 22)][DBLP ] ICDE, 1991, pp:345-354 [Conf ] Cites:
Shaul Dar , H. V. Jagadish A Spanning Tree Transitive Closure Algorithm. [Citation Graph (10, 24)][DBLP ] ICDE, 1992, pp:2-11 [Conf ] Cites:
H. V. Jagadish , Alberto O. Mendelzon , Inderpal Singh Mumick Managing Rule Conflicts in an Active Database. [Citation Graph (3, 14)][DBLP ] PODS, 1996, pp:192-201 [Conf ] Cites:
H. V. Jagadish , Raymond T. Ng , Divesh Srivastava Substring Selectivity Estimation. [Citation Graph (3, 11)][DBLP ] PODS, 1999, pp:249-260 [Conf ] Cites:
Yannis E. Ioannidis , Viswanath Poosala Balancing Histogram Optimality and Practicality for Query Result Size Estimation. [Citation Graph (28, 17)][DBLP ] SIGMOD Conference, 1995, pp:233-244 [Conf ]
Viswanath Poosala , Yannis E. Ioannidis , Peter J. Haas , Eugene J. Shekita Improved Histograms for Selectivity Estimation of Range Predicates. [Citation Graph (46, 17)][DBLP ] SIGMOD Conference, 1996, pp:294-305 [Conf ]
Yannis E. Ioannidis Universality of Serial Histograms. [Citation Graph (19, 10)][DBLP ] VLDB, 1993, pp:256-267 [Conf ]
Rakesh Agrawal , Alexander Borgida , H. V. Jagadish Efficient Management of Transitive Relationships in Large Data and Knowledge Bases. [Citation Graph (21, 20)][DBLP ] SIGMOD Conference, 1989, pp:253-262 [Conf ] Cites:
Ru-Mei Kung , Eric N. Hanson , Yannis E. Ioannidis , Timos K. Sellis , Leonard D. Shapiro , Michael Stonebraker Heuristic Search in Data Base Systems. [Citation Graph (29, 0)][DBLP ] Expert Database Workshop, 1984, pp:537-548 [Conf ]
Yannis E. Ioannidis On the Computation of the Transitive Closure of Relational Operators. [Citation Graph (37, 11)][DBLP ] VLDB, 1986, pp:403-411 [Conf ]
Yannis E. Ioannidis , Raghu Ramakrishnan Efficient Transitive Closure Algorithms. [Citation Graph (40, 12)][DBLP ] VLDB, 1988, pp:382-394 [Conf ]
H. V. Jagadish , Rakesh Agrawal , Linda Ness A Study of Transitive Closure As a Recursion Mechanism. [Citation Graph (33, 18)][DBLP ] SIGMOD Conference, 1987, pp:331-344 [Conf ] Cites:
Yannis E. Ioannidis , Eugene Wong An Algebraic Approach to Recursive Inference. [Citation Graph (17, 0)][DBLP ] Expert Database Conf., 1986, pp:295-309 [Conf ]
Yannis E. Ioannidis A Time Bound on the Materialization of some Recursively Defined Views. [Citation Graph (31, 6)][DBLP ] VLDB, 1985, pp:219-226 [Conf ]
Yannis E. Ioannidis On the Computation of the Transitive Closure of Relational Operators. [Citation Graph (37, 11)][DBLP ] VLDB, 1986, pp:403-411 [Conf ]
Rakesh Agrawal , H. V. Jagadish Direct Algorithms for Computing the Transitive Closure of Database Relations. [Citation Graph (30, 11)][DBLP ] VLDB, 1987, pp:255-266 [Conf ] Cites:
Rakesh Agrawal , H. V. Jagadish Efficient Search in Very Large Databases. [Citation Graph (5, 5)][DBLP ] VLDB, 1988, pp:407-418 [Conf ] Cites:
Rakesh Agrawal , H. V. Jagadish Hybrid Transitive Closure Algorithms. [Citation Graph (13, 20)][DBLP ] VLDB, 1990, pp:326-334 [Conf ] Cites:
Ru-Mei Kung , Eric N. Hanson , Yannis E. Ioannidis , Timos K. Sellis , Leonard D. Shapiro , Michael Stonebraker Heuristic Search in Data Base Systems. [Citation Graph (29, 0)][DBLP ] Expert Database Workshop, 1984, pp:537-548 [Conf ]
Yannis E. Ioannidis On the Computation of the Transitive Closure of Relational Operators. [Citation Graph (37, 11)][DBLP ] VLDB, 1986, pp:403-411 [Conf ]
Yannis E. Ioannidis , Raghu Ramakrishnan Efficient Transitive Closure Algorithms. [Citation Graph (40, 12)][DBLP ] VLDB, 1988, pp:382-394 [Conf ]
Christos Faloutsos , H. V. Jagadish On B-Tree Indices for Skewed Distributions. [Citation Graph (11, 6)][DBLP ] VLDB, 1992, pp:363-374 [Conf ] Cites:
Christos Faloutsos , H. V. Jagadish , Nikolaos Sidiropoulos Recovering Information from Summary Data. [Citation Graph (8, 19)][DBLP ] VLDB, 1997, pp:36-45 [Conf ] Cites:
H. V. Jagadish , Nick Koudas , S. Muthukrishnan , Viswanath Poosala , Kenneth C. Sevcik , Torsten Suel Optimal Histograms with Quality Guarantees. [Citation Graph (15, 9)][DBLP ] VLDB, 1998, pp:275-286 [Conf ] Cites:
Yannis E. Ioannidis , Viswanath Poosala Balancing Histogram Optimality and Practicality for Query Result Size Estimation. [Citation Graph (28, 17)][DBLP ] SIGMOD Conference, 1995, pp:233-244 [Conf ]
Viswanath Poosala , Yannis E. Ioannidis , Peter J. Haas , Eugene J. Shekita Improved Histograms for Selectivity Estimation of Range Predicates. [Citation Graph (46, 17)][DBLP ] SIGMOD Conference, 1996, pp:294-305 [Conf ]
Yannis E. Ioannidis Universality of Serial Histograms. [Citation Graph (19, 10)][DBLP ] VLDB, 1993, pp:256-267 [Conf ]
Viswanath Poosala , Yannis E. Ioannidis Selectivity Estimation Without the Attribute Value Independence Assumption. [Citation Graph (22, 14)][DBLP ] VLDB, 1997, pp:486-495 [Conf ]
H. V. Jagadish , Olga Kapitskaia , Raymond T. Ng , Divesh Srivastava Multi-Dimensional Substring Selectivity Estimation. [Citation Graph (3, 16)][DBLP ] VLDB, 1999, pp:387-398 [Conf ] Cites:
Yannis E. Ioannidis , Viswanath Poosala Balancing Histogram Optimality and Practicality for Query Result Size Estimation. [Citation Graph (28, 17)][DBLP ] SIGMOD Conference, 1995, pp:233-244 [Conf ]
Viswanath Poosala , Yannis E. Ioannidis , Peter J. Haas , Eugene J. Shekita Improved Histograms for Selectivity Estimation of Range Predicates. [Citation Graph (46, 17)][DBLP ] SIGMOD Conference, 1996, pp:294-305 [Conf ]
Yannis E. Ioannidis Universality of Serial Histograms. [Citation Graph (19, 10)][DBLP ] VLDB, 1993, pp:256-267 [Conf ]
Viswanath Poosala , Yannis E. Ioannidis Selectivity Estimation Without the Attribute Value Independence Assumption. [Citation Graph (22, 14)][DBLP ] VLDB, 1997, pp:486-495 [Conf ]
H. V. Jagadish , Laks V. S. Lakshmanan , Divesh Srivastava What can Hierarchies do for Data Warehouses? [Citation Graph (3, 22)][DBLP ] VLDB, 1999, pp:530-541 [Conf ] Cites:
H. V. Jagadish , J. Madar , Raymond T. Ng Semantic Compression and Pattern Extraction with Fascicles. [Citation Graph (2, 17)][DBLP ] VLDB, 1999, pp:186-198 [Conf ] Cites:
Daniel Barbará , William DuMouchel , Christos Faloutsos , Peter J. Haas , Joseph M. Hellerstein , Yannis E. Ioannidis , H. V. Jagadish , Theodore Johnson , Raymond T. Ng , Viswanath Poosala , Kenneth A. Ross , Kenneth C. Sevcik The New Jersey Data Reduction Report. [Citation Graph (17, 69)][DBLP ] IEEE Data Eng. Bull., 1997, v:20, n:4, pp:3-45 [Journal ]
H. V. Jagadish , Nick Koudas , S. Muthukrishnan Mining Deviants in a Time Series Database. [Citation Graph (1, 9)][DBLP ] VLDB, 1999, pp:102-113 [Conf ] Cites:
Yannis E. Ioannidis , Viswanath Poosala Balancing Histogram Optimality and Practicality for Query Result Size Estimation. [Citation Graph (28, 17)][DBLP ] SIGMOD Conference, 1995, pp:233-244 [Conf ]
Viswanath Poosala , Yannis E. Ioannidis , Peter J. Haas , Eugene J. Shekita Improved Histograms for Selectivity Estimation of Range Predicates. [Citation Graph (46, 17)][DBLP ] SIGMOD Conference, 1996, pp:294-305 [Conf ]
Yannis E. Ioannidis Universality of Serial Histograms. [Citation Graph (19, 10)][DBLP ] VLDB, 1993, pp:256-267 [Conf ]
Viswanath Poosala , Yannis E. Ioannidis Selectivity Estimation Without the Attribute Value Independence Assumption. [Citation Graph (22, 14)][DBLP ] VLDB, 1997, pp:486-495 [Conf ]
Divesh Srivastava , Shaul Dar , H. V. Jagadish , Alon Y. Levy Answering Queries with Aggregation Using Views. [Citation Graph (27, 23)][DBLP ] VLDB, 1996, pp:318-329 [Conf ] Cites:
Daniel Barbará , William DuMouchel , Christos Faloutsos , Peter J. Haas , Joseph M. Hellerstein , Yannis E. Ioannidis , H. V. Jagadish , Theodore Johnson , Raymond T. Ng , Viswanath Poosala , Kenneth A. Ross , Kenneth C. Sevcik The New Jersey Data Reduction Report. [Citation Graph (17, 69)][DBLP ] IEEE Data Eng. Bull., 1997, v:20, n:4, pp:3-45 [Journal ] Cites:
Yannis E. Ioannidis , Viswanath Poosala Balancing Histogram Optimality and Practicality for Query Result Size Estimation. [Citation Graph (28, 17)][DBLP ] SIGMOD Conference, 1995, pp:233-244 [Conf ]
Viswanath Poosala , Yannis E. Ioannidis , Peter J. Haas , Eugene J. Shekita Improved Histograms for Selectivity Estimation of Range Predicates. [Citation Graph (46, 17)][DBLP ] SIGMOD Conference, 1996, pp:294-305 [Conf ]
Yannis E. Ioannidis Universality of Serial Histograms. [Citation Graph (19, 10)][DBLP ] VLDB, 1993, pp:256-267 [Conf ]
Viswanath Poosala , Yannis E. Ioannidis Estimation of Query-Result Distribution and its Application in Parallel-Join Load Balancing. [Citation Graph (5, 23)][DBLP ] VLDB, 1996, pp:448-459 [Conf ]
Viswanath Poosala , Yannis E. Ioannidis Selectivity Estimation Without the Attribute Value Independence Assumption. [Citation Graph (22, 14)][DBLP ] VLDB, 1997, pp:486-495 [Conf ]
Yannis E. Ioannidis , Viswanath Poosala Histogram-Based Solutions to Diverse Database Estimation Problems. [Citation Graph (7, 11)][DBLP ] IEEE Data Eng. Bull., 1995, v:18, n:3, pp:10-18 [Journal ]
Yannis E. Ioannidis , Stavros Christodoulakis Optimal Histograms for Limiting Worst-Case Error Propagation in the Size of Join Results. [Citation Graph (15, 12)][DBLP ] ACM Trans. Database Syst., 1993, v:18, n:4, pp:709-748 [Journal ]
H. V. Jagadish Review - Aqua: A Fast Decision Support Systems Using Approximate Query Answers. [Citation Graph (0, 3)][DBLP ] ACM SIGMOD Digital Review, 1999, v:1, n:, pp:- [Journal ] Cites:
Daniel Barbará , William DuMouchel , Christos Faloutsos , Peter J. Haas , Joseph M. Hellerstein , Yannis E. Ioannidis , H. V. Jagadish , Theodore Johnson , Raymond T. Ng , Viswanath Poosala , Kenneth A. Ross , Kenneth C. Sevcik The New Jersey Data Reduction Report. [Citation Graph (17, 69)][DBLP ] IEEE Data Eng. Bull., 1997, v:20, n:4, pp:3-45 [Journal ]
Rakesh Agrawal , H. V. Jagadish Algorithms for Searching Massive Graphs. [Citation Graph (3, 17)][DBLP ] IEEE Trans. Knowl. Data Eng., 1994, v:6, n:2, pp:225-238 [Journal ] Cites:
Ru-Mei Kung , Eric N. Hanson , Yannis E. Ioannidis , Timos K. Sellis , Leonard D. Shapiro , Michael Stonebraker Heuristic Search in Data Base Systems. [Citation Graph (29, 0)][DBLP ] Expert Database Workshop, 1984, pp:537-548 [Conf ]
Yannis E. Ioannidis On the Computation of the Transitive Closure of Relational Operators. [Citation Graph (37, 11)][DBLP ] VLDB, 1986, pp:403-411 [Conf ]
Rakesh Agrawal , Shaul Dar , H. V. Jagadish Direct Transitive Closure Algorithms: Design and Performance Evaluation. [Citation Graph (20, 26)][DBLP ] ACM Trans. Database Syst., 1990, v:15, n:3, pp:427-458 [Journal ] Cites:
Ru-Mei Kung , Eric N. Hanson , Yannis E. Ioannidis , Timos K. Sellis , Leonard D. Shapiro , Michael Stonebraker Heuristic Search in Data Base Systems. [Citation Graph (29, 0)][DBLP ] Expert Database Workshop, 1984, pp:537-548 [Conf ]
Yannis E. Ioannidis On the Computation of the Transitive Closure of Relational Operators. [Citation Graph (37, 11)][DBLP ] VLDB, 1986, pp:403-411 [Conf ]
H. V. Jagadish A Compression Technique to Materialize Transitive Closure. [Citation Graph (10, 26)][DBLP ] ACM Trans. Database Syst., 1990, v:15, n:4, pp:558-598 [Journal ] Cites: