• Stoian M, Milbradt R and Mendl C. (2024). On the Optimal Linear Contraction Order of Tree Tensor Networks, and Beyond. SIAM Journal on Scientific Computing. 10.1137/23M161286X. 46:5. (B647-B668). Online publication date: 31-Oct-2024.

    https://epubs.siam.org/doi/10.1137/23M161286X

  • Izenov Y, Datta A, Tsan B and Rusu F. (2024). Sub-optimal Join Order Identification with L1-error. Proceedings of the ACM on Management of Data. 2:1. (1-24). Online publication date: 12-Mar-2024.

    https://doi.org/10.1145/3639272

  • Varvoutas K, Bellas C, Kougka G and Gounaris A. Optimizing the Execution of Product Data Models. IEEE Access. 10.1109/ACCESS.2024.3366081. 12. (25397-25410).

    https://ieeexplore.ieee.org/document/10436096/

  • Schönberger M, Trummer I and Mauerer W. (2023). Quantum-Inspired Digital Annealing for Join Ordering. Proceedings of the VLDB Endowment. 17:3. (511-524). Online publication date: 1-Nov-2023.

    https://doi.org/10.14778/3632093.3632112

  • Sun Y, Kumar S, Gilray T and Micinski K. (2023). Communication-Avoiding Recursive Aggregation 2023 IEEE International Conference on Cluster Computing (CLUSTER). 10.1109/CLUSTER52292.2023.00024. 979-8-3503-0792-4. (197-208).

    https://ieeexplore.ieee.org/document/10319975/

  • Yan Z, Uotila V and Lu J. (2023). Join Order Selection with Deep Reinforcement Learning: Fundamentals, Techniques, and Challenges. Proceedings of the VLDB Endowment. 16:12. (3882-3885). Online publication date: 1-Aug-2023.

    https://doi.org/10.14778/3611540.3611576

  • Haffner I and Dittrich J. (2023). Efficiently Computing Join Orders with Heuristic Search. Proceedings of the ACM on Management of Data. 1:1. (1-26). Online publication date: 26-May-2023.

    https://doi.org/10.1145/3588927

  • Yadav R, Valluri S and Zaït M. (2023). AIM: A practical approach to automated index management for SQL databases 2023 IEEE 39th International Conference on Data Engineering (ICDE). 10.1109/ICDE55515.2023.00257. 979-8-3503-2227-9. (3349-3362).

    https://ieeexplore.ieee.org/document/10184587/

  • Chen T, Gao J, Chen H and Tu Y. (2023). LOGER: A Learned Optimizer Towards Generating Efficient and Robust Query Execution Plans. Proceedings of the VLDB Endowment. 16:7. (1777-1789). Online publication date: 1-Mar-2023.

    https://doi.org/10.14778/3587136.3587150

  • Barkowsky M and Giese H. (2023). Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions. Journal of Logical and Algebraic Methods in Programming. 10.1016/j.jlamp.2022.100841. 131. (100841). Online publication date: 1-Feb-2023.

    https://linkinghub.elsevier.com/retrieve/pii/S2352220822000943

  • Wojtowicz D, Yin S, Martinez-Gil J, Morvan F and Hameurlain A. (2022). Multi-Cloud Query Optimisation with Accurate and Efficient Quoting 2022 IEEE International Conference on Big Data (Big Data). 10.1109/BigData55660.2022.10020835. 978-1-6654-8045-1. (228-233).

    https://ieeexplore.ieee.org/document/10020835/

  • Mancini R, Karthik S, Chandra B, Mageirakos V and Ailamaki A. Efficient Massively Parallel Join Optimization for Large Queries. Proceedings of the 2022 International Conference on Management of Data. (122-135).

    https://doi.org/10.1145/3514221.3517871

  • Snodgrass R, Currim S and Suh Y. (2021). Have query optimizers hit the wall?. The VLDB Journal. 10.1007/s00778-021-00689-y.

    https://link.springer.com/10.1007/s00778-021-00689-y

  • Barkowsky M and Giese H. Host-Graph-Sensitive RETE Nets for Incremental Graph Pattern Matching. Graph Transformation. (145-163).

    https://doi.org/10.1007/978-3-030-78946-6_8

  • Lan H, Bao Z and Peng Y. (2021). A Survey on Advancing the DBMS Query Optimizer: Cardinality Estimation, Cost Model, and Plan Enumeration. Data Science and Engineering. 10.1007/s41019-020-00149-7. 6:1. (86-101). Online publication date: 1-Mar-2021.

    http://link.springer.com/10.1007/s41019-020-00149-7

  • Kougka G, Varvoutas K, Gounaris A, Tsakalidis G and Vergidis K. (2020). On Knowledge Transfer from Cost-Based Optimization of Data-Centric Workflows to Business Process Redesign. Transactions on Large-Scale Data- and Knowledge-Centered Systems XLIII. 10.1007/978-3-662-62199-8_3. (62-85).

    http://link.springer.com/10.1007/978-3-662-62199-8_3

  • Karimov J, Rabl T and Markl V. (2020). AJoin. Proceedings of the VLDB Endowment. 13:4. (435-448). Online publication date: 9-Dec-2019.

    https://doi.org/10.14778/3372716.3372718

  • Kougka G and Gounaris A. (2019). Optimization of data flow execution in a parallel environment. Distributed and Parallel Databases. 37:3. (385-410). Online publication date: 1-Sep-2019.

    https://doi.org/10.1007/s10619-018-7243-3

  • Cai W, Balazinska M and Suciu D. Pessimistic Cardinality Estimation. Proceedings of the 2019 International Conference on Management of Data. (18-35).

    https://doi.org/10.1145/3299869.3319894

  • Kolchinsky I and Schuster A. Real-Time Multi-Pattern Detection over Event Streams. Proceedings of the 2019 International Conference on Management of Data. (589-606).

    https://doi.org/10.1145/3299869.3319869

  • Heling L. Quality-Driven Query Processing over Federated RDF Data Sources. The Semantic Web: ESWC 2019 Satellite Events. (209-219).

    https://doi.org/10.1007/978-3-030-32327-1_40

  • Liu M, Pan X and Yin Y. (2018). Randomized Approximate Nearest Neighbor Search with Limited Adaptivity. ACM Transactions on Parallel Computing. 5:1. (1-26). Online publication date: 19-Sep-2018.

    https://doi.org/10.1145/3209884

  • Zhang D, Laborde P, Lebanoff L and Dechev D. (2018). Lock-Free Transactional Transformation for Linked Data Structures. ACM Transactions on Parallel Computing. 5:1. (1-37). Online publication date: 19-Sep-2018.

    https://doi.org/10.1145/3209690

  • Pandurangan G, Robinson P and Scquizzato M. (2018). Fast Distributed Algorithms for Connectivity and MST in Large Graphs. ACM Transactions on Parallel Computing. 5:1. (1-22). Online publication date: 19-Sep-2018.

    https://doi.org/10.1145/3209689

  • Kolchinsky I and Schuster A. (2018). Join query optimization techniques for complex event processing applications. Proceedings of the VLDB Endowment. 11:11. (1332-1345). Online publication date: 1-Jul-2018.

    https://doi.org/10.14778/3236187.3236189

  • Neumann T and Radke B. Adaptive Optimization of Very Large Join Queries. Proceedings of the 2018 International Conference on Management of Data. (677-692).

    https://doi.org/10.1145/3183713.3183733

  • Allen S, Hellerstein L, Kletenik D and Ünlüyurt T. (2017). Evaluation of Monotone DNF Formulas. Algorithmica. 77:3. (661-685). Online publication date: 1-Mar-2017.

    https://doi.org/10.1007/s00453-015-0092-9

  • Kougka G and Gounaris A. (2017). Cost Optimization of Data Flows Based on Task Re-ordering. Transactions on Large-Scale Data- and Knowledge-Centered Systems XXXIII. 10.1007/978-3-662-55696-2_4. (113-145).

    http://link.springer.com/10.1007/978-3-662-55696-2_4

  • Kastrati F and Moerkotte G. (2016). Optimization of conjunctive predicates for main memory column stores. Proceedings of the VLDB Endowment. 9:12. (1125-1136). Online publication date: 1-Aug-2016.

    https://doi.org/10.14778/2994509.2994529

  • Deshpande A, Hellerstein L and Kletenik D. (2016). Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack. ACM Transactions on Algorithms. 12:3. (1-28). Online publication date: 15-Jun-2016.

    https://doi.org/10.1145/2876506

  • Singh V, Zong B and Singh A. (2016). Nearest Keyword Set Search in Multi-Dimensional Datasets. IEEE Transactions on Knowledge and Data Engineering. 28:3. (741-755). Online publication date: 1-Mar-2016.

    https://doi.org/10.1109/TKDE.2015.2492549

  • Oguz D, Ergenc B, Yin S, Dikenelli O and Hameurlain A. (2015). Federated query processing on linked data: a qualitative survey and open challenges. The Knowledge Engineering Review. 10.1017/S0269888915000107. 30:5. (545-563). Online publication date: 1-Nov-2015.

    https://www.cambridge.org/core/product/identifier/S0269888915000107/type/journal_article

  • Zeng Y, Lu A, Xia L, Tian C and Tay Y. SAM. Proceedings, Part I, of the 26th International Conference on Database and Expert Systems Applications - Volume 9261. (367-383).

    https://doi.org/10.1007/978-3-319-22849-5_25

  • Meister A, Breß S and Saake G. (2015). Toward GPU-accelerated Database Optimization. Datenbank-Spektrum. 10.1007/s13222-015-0184-3. 15:2. (131-140). Online publication date: 1-Jul-2015.

    http://link.springer.com/10.1007/s13222-015-0184-3

  • Gonçalves F, Guimarães F and Souza M. (2014). Query join ordering optimization with evolutionary multi-agent systems. Expert Systems with Applications: An International Journal. 41:15. (6934-6944). Online publication date: 1-Nov-2014.

    https://doi.org/10.1016/j.eswa.2014.05.005

  • Bruno N. (2014). Query Optimization. Computing Handbook, Third Edition. 10.1201/b16768-14. (11-1-11-17). Online publication date: 13-May-2014.

    http://www.crcnetbase.com/doi/abs/10.1201/b16768-14

  • Golshanara L, Rouhani Rankoohi S and Shah-Hosseini H. (2014). A multi-colony ant algorithm for optimizing join queries in distributed database systems. Knowledge and Information Systems. 39:1. (175-206). Online publication date: 1-Apr-2014.

    https://doi.org/10.1007/s10115-012-0608-4

  • Giannikis G, Makreshanski D, Alonso G and Kossmann D. (2014). Shared workload optimization. Proceedings of the VLDB Endowment. 7:6. (429-440). Online publication date: 1-Feb-2014.

    https://doi.org/10.14778/2732279.2732280

  • Deshpande A, Hellerstein L and Kletenik D. Approximation algorithms for stochastic boolean function evaluation and stochastic submodular set cover. Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms. (1453-1467).

    /doi/10.5555/2634074.2634181

  • Fokoue A, Bornea M, Dolby J, Kementsietsidis A and Srinivas K. (2014). An Offline Optimal SPARQL Query Planning Approach to Evaluate Online Heuristic Planners. Web Information Systems Engineering – WISE 2014. 10.1007/978-3-319-11749-2_36. (480-495).

    http://link.springer.com/10.1007/978-3-319-11749-2_36

  • Kostrzewa D and Josiński H. (2014). The exIWO Metaheuristic – A Recapitulation of the Research on the Join Ordering Problem. Beyond Databases, Architectures, and Structures. 10.1007/978-3-319-06932-6_2. (10-19).

    https://link.springer.com/10.1007/978-3-319-06932-6_2

  • Petersen C, Gorges M, Dunsmuir D, Ansermino M and Dumont G. (2013). Experience report. ACM SIGPLAN Notices. 48:9. (357-362). Online publication date: 12-Nov-2013.

    https://doi.org/10.1145/2544174.2500615

  • Delbianco G and Nanevski A. (2013). Hoare-style reasoning with (algebraic) continuations. ACM SIGPLAN Notices. 48:9. (363-376). Online publication date: 12-Nov-2013.

    https://doi.org/10.1145/2544174.2500593

  • Gonçalves F, Guimarães F and Souza M. An evolutionary multi-agent system for database query optimization. Proceedings of the 15th annual conference on Genetic and evolutionary computation. (535-542).

    https://doi.org/10.1145/2463372.2465802

  • Joshi M and Srivastava P. (2013). Query Optimization. International Journal of Intelligent Information Technologies. 10.4018/jiit.2013010103. 9:1. (40-55). Online publication date: 1-Jan-2013.

    https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jiit.2013010103

  • Dokeroglu T, Tosun U and Cosar A. (2012). Particle Swarm Intelligence as a new heuristic for the optimization of distributed database queries 2012 6th International Conference on Application of Information and Communication Technologies (AICT). 10.1109/ICAICT.2012.6398467. 978-1-4673-1740-5. (1-7).

    http://ieeexplore.ieee.org/document/6398467/

  • Deshpande A and Hellerstein L. (2012). Parallel pipelined filter ordering with precedence constraints. ACM Transactions on Algorithms. 8:4. (1-38). Online publication date: 1-Sep-2012.

    https://doi.org/10.1145/2344422.2344431

  • Dökeroğlu T and Coşar A. (2011). Dynamic Programming with Ant Colony Optimization Metaheuristic for Optimization of Distributed Database Queries. Computer and Information Sciences II. 10.1007/978-1-4471-2155-8_13. (107-113).

    http://link.springer.com/10.1007/978-1-4471-2155-8_13

  • Zhu Y, Raghavan V and Rundensteiner E. (2010). A new look at generating multi-join continuous query plans. Data & Knowledge Engineering. 69:5. (424-443). Online publication date: 1-May-2010.

    https://doi.org/10.1016/j.datak.2009.11.001

  • Li D and Yang C. A Trust Evaluation Model for Web Service Selection. Proceedings of the 2010 Third International Symposium on Intelligent Information Technology and Security Informatics. (306-310).

    https://doi.org/10.1109/IITSI.2010.175

  • Bruno N, Galindo-Legaria C and Joshi M. (2010). Polynomial heuristics for query optimization 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010). 10.1109/ICDE.2010.5447916. 978-1-4244-5445-7. (589-600).

    http://ieeexplore.ieee.org/document/5447916/

  • Bini T, Lange A, Sunye M and Silva F. (2009). Stableness in large join query optimization 2009 24th International Symposium on Computer and Information Sciences (ISCIS). 10.1109/ISCIS.2009.5291898. 978-1-4244-5021-3. (639-644).

    http://ieeexplore.ieee.org/document/5291898/

  • Moerkotte G, Neumann T and Steidl G. (2009). Preventing bad plans by bounding the impact of cardinality estimation errors. Proceedings of the VLDB Endowment. 2:1. (982-993). Online publication date: 1-Aug-2009.

    https://doi.org/10.14778/1687627.1687738

  • Raghavan V, Zhu Y, Rundensteiner E and Dougherty D. Multi-Join Continuous Query Optimization. Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier. (91-106).

    https://doi.org/10.1007/978-3-642-02843-4_11

  • Neumann T. Query simplification. Proceedings of the 2009 ACM SIGMOD International Conference on Management of data. (403-414).

    https://doi.org/10.1145/1559845.1559889

  • Condon A, Deshpande A, Hellerstein L and Wu N. (2009). Algorithms for distributional and adversarial pipelined filter ordering problems. ACM Transactions on Algorithms. 5:2. (1-34). Online publication date: 1-Mar-2009.

    https://doi.org/10.1145/1497290.1497300

  • KWON T, KIM H, KIM M and SON J. (2009). AMJoin: An Advanced Join Algorithm for Multiple Data Streams Using a Bit-Vector Hash Table. IEICE Transactions on Information and Systems. 10.1587/transinf.E92.D.1429. E92-D:7. (1429-1434).

    http://joi.jlc.jst.go.jp/JST.JSTAGE/transinf/E92.D.1429?from=CrossRef

  • Liu Z, Parthasarathy S, Ranganathan A and Yang H. A generic flow algorithm for shared filter ordering problems. Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. (79-88).

    https://doi.org/10.1145/1376916.1376929

  • Galindo-Legaria C, Grabs T, Gukal S, Herbert S, Surna A, Wang S, Yu W, Zabback P and Zhang S. Optimizing Star Join Queries for Data Warehousing in Microsoft SQL Server. Proceedings of the 2008 IEEE 24th International Conference on Data Engineering. (1190-1199).

    https://doi.org/10.1109/ICDE.2008.4497528

  • Deshpande A and Hellerstein L. Flow Algorithms for Parallel Query Optimization. Proceedings of the 2008 IEEE 24th International Conference on Data Engineering. (754-763).

    https://doi.org/10.1109/ICDE.2008.4497484

  • Asghari K, Mamaghani A and Meybodi M. An Evolutionary Algorithm for Query Optimization in Database. Innovative Techniques in Instruction Technology, E-learning, E-assessment, and Education. 10.1007/978-1-4020-8739-4_44. (249-254).

    http://link.springer.com/10.1007/978-1-4020-8739-4_44

  • Mamaghani A, Asghari K, Mahmoudi F and Meybodi M. A novel hybrid algorithm for join ordering problem in database queries. Proceedings of the 6th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics. (104-109).

    /doi/10.5555/1984502.1984521

  • Gedik B, Wu K, Yu P and Liu L. (2007). GrubJoin. IEEE Transactions on Knowledge and Data Engineering. 19:10. (1363-1380). Online publication date: 1-Oct-2007.

    https://doi.org/10.1109/TKDE.2007.190630

  • Guttoski P, Sunye M and Silva F. (2007). Kruskal's Algorithm for Query Tree Optimization 11th International Database Engineering and Applications Symposium (IDEAS 2007). 10.1109/IDEAS.2007.4318118. 0-7695-2947-X. (296-302).

    http://ieeexplore.ieee.org/document/4318118/

  • Li Q, Shao M, Markl V, Beyer K, Colby L and Lohman G. (2007). Adaptively Reordering Joins during Query Execution 2007 IEEE 23rd International Conference on Data Engineering. 10.1109/ICDE.2007.367848. 1-4244-0802-4. (26-35).

    http://ieeexplore.ieee.org/document/4221651/

  • Deshpande A, Ives Z and Raman V. (2007). Adaptive query processing. Foundations and Trends in Databases. 1:1. (1-140). Online publication date: 1-Jan-2007.

    /doi/10.5555/1331939.1331940

  • Makino K, Uno Y and Ibaraki T. (2006). Minimum edge ranking spanning trees of split graphs. Discrete Applied Mathematics. 154:16. (2373-2386). Online publication date: 1-Nov-2006.

    https://doi.org/10.1016/j.dam.2006.04.018

  • Srivastava U, Munagala K, Widom J and Motwani R. Query optimization over web services. Proceedings of the 32nd international conference on Very large data bases. (355-366).

    /doi/10.5555/1182635.1164159

  • Kolman P and Scheideler C. (2006). Improved bounds for the unsplittable flow problem. Journal of Algorithms. 61:1. (20-44). Online publication date: 1-Sep-2006.

    https://doi.org/10.1016/j.jalgor.2004.07.006

  • Dereniowski D and Kubale M. (2006). Efficient Parallel Query Processing by Graph Ranking. Fundamenta Informaticae. 69:3. (273-285). Online publication date: 1-Aug-2006.

    /doi/10.5555/2367489.2367491

  • Neumann T, Helmer S and Moerkotte G. On the optimal ordering of maps, selections, and joins under factorization. Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling. (115-126).

    https://doi.org/10.1007/11788911_10

  • Gomes J and Choi H. Finding Optimal Join Tree forMulti-Join Stream Queries in a Production System. Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems.

    https://doi.org/10.1109/ICDCSW.2006.53

  • Willis D, Pearce D and Noble J. Efficient object querying for java. Proceedings of the 20th European conference on Object-Oriented Programming. (28-49).

    https://doi.org/10.1007/11785477_3

  • Pagh A and Pagh R. Scalable computation of acyclic joins. Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. (225-232).

    https://doi.org/10.1145/1142351.1142384

  • Dereniowski D and Kubale M. (2005). Efficient Parallel Query Processing by Graph Ranking. Fundamenta Informaticae. 69:3. (273-285). Online publication date: 1-Feb-2006.

    /doi/10.5555/1227256.1227258

  • Kaushik R, Naughton J, Ramakrishnan R and Chakravarthy V. (2005). Synopses for query optimization. ACM Transactions on Database Systems. 30:4. (1102-1127). Online publication date: 1-Dec-2005.

    https://doi.org/10.1145/1114244.1114251

  • Polyzotis N. Selectivity-based partitioning. Proceedings of the 14th ACM international conference on Information and knowledge management. (720-727).

    https://doi.org/10.1145/1099554.1099730

  • Dereniowski D and Kubale M. Parallel query processing and edge ranking of graphs. Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics. (463-469).

    https://doi.org/10.1007/11752578_56

  • Zhu Q, Tao Y and Zuzarte C. (2005). Optimizing complex queries based on similarities of subqueries. Knowledge and Information Systems. 8:3. (350-373). Online publication date: 1-Sep-2005.

    /doi/10.5555/3225641.3225825

  • Zhu Q, Tao Y and Zuzarte C. (2005). Optimizing complex queries based on similarities of subqueries. Knowledge and Information Systems. 10.1007/s10115-004-0189-y. 8:3. (350-373). Online publication date: 1-Sep-2005.

    http://link.springer.com/10.1007/s10115-004-0189-y

  • Neumann T, Helmer S and Moerkotte G. On the Optimal Ordering of Maps and Selections under Factorization. Proceedings of the 21st International Conference on Data Engineering. (490-501).

    https://doi.org/10.1109/ICDE.2005.97

  • Madden S, Franklin M, Hellerstein J and Hong W. (2005). TinyDB: an acquisitional query processing system for sensor networks. ACM Transactions on Database Systems. 30:1. (122-173). Online publication date: 1-Mar-2005.

    https://doi.org/10.1145/1061318.1061322

  • Babcock B, Babu S, Datar M, Motwani R and Thomas D. (2004). Operator scheduling in data stream systems. The VLDB Journal — The International Journal on Very Large Data Bases. 13:4. (333-353). Online publication date: 1-Dec-2004.

    https://doi.org/10.1007/s00778-004-0132-6

  • Chaudhuri S, Gravano L and Marian A. (2004). Optimizing Top-k Selection Queries over Multimedia Repositories. IEEE Transactions on Knowledge and Data Engineering. 16:8. (992-1009). Online publication date: 1-Aug-2004.

    https://doi.org/10.1109/TKDE.2004.30

  • Murota K and Shioura A. (2004). Quadratic M-convex and L-convex functions. Advances in Applied Mathematics. 33:2. (318-341). Online publication date: 1-Aug-2004.

    https://doi.org/10.1016/j.aam.2003.11.001

  • Kaushik R, Ramakrishnan R and Chakaravarthy V. Synopses for query optimization. Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. (201-209).

    https://doi.org/10.1145/1055558.1055586

  • Ayad A and Naughton J. Static optimization of conjunctive queries with sliding windows over infinite streams. Proceedings of the 2004 ACM SIGMOD international conference on Management of data. (419-430).

    https://doi.org/10.1145/1007568.1007616

  • Tao Y, Zhu Q, Zuzarte C and Lau W. Optimizing large star-schema queries with snowflakes via heuristic-based query rewriting. Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research. (279-293).

    /doi/10.5555/961322.961365

  • Madden S, Franklin M, Hellerstein J and Hong W. The design of an acquisitional query processor for sensor networks. Proceedings of the 2003 ACM SIGMOD international conference on Management of data. (491-502).

    https://doi.org/10.1145/872757.872817

  • Vijayshankar Raman , Deshpande A and Hellerstein J. Using state modules for adaptive query processing 19th International Conference on Data Engineering. 10.1109/ICDE.2003.1260805. 0-7803-7665-X. (353-364).

    http://ieeexplore.ieee.org/document/1260805/

  • Tao Y, Zhu Q and Zuzarte C. (2003). Exploiting Similarity of Subqueries for Complex Query Optimization. Database and Expert Systems Applications. 10.1007/978-3-540-45227-0_73. (747-759).

    http://link.springer.com/10.1007/978-3-540-45227-0_73

  • Tao Y, Zhu Q and Zuzarte C. Exploiting common subqueries for complex query optimization. Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research.

    /doi/10.5555/782115.782127

  • Chatterji S, Evani S, Ganguly S and Yemmanuru M. On the complexity of approximate query optimization. Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. (282-292).

    https://doi.org/10.1145/543613.543650

  • Gaur D, Ibaraki T and Krishnamurti R. (2002). Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem. Journal of Algorithms. 43:1. (138-152). Online publication date: 1-Apr-2002.

    https://doi.org/10.1006/jagm.2002.1221

  • Makino K, Uno Y and Ibaraki T. (2002). Minimum Edge Ranking Spanning Trees of Threshold Graphs. Algorithms and Computation. 10.1007/3-540-36136-7_38. (428-440).

    http://link.springer.com/10.1007/3-540-36136-7_38

  • Arata K, Iwata S, Makino K and Fujishige S. (2002). Locating Sources to Meet Flow Demands in Undirected Networks. Journal of Algorithms. 42:1. (54-68). Online publication date: 1-Jan-2002.

    https://doi.org/10.1006/jagm.2001.1203

  • Asano T and Williamson D. (2002). Improved Approximation Algorithms for MAX SAT. Journal of Algorithms. 42:1. (173-202). Online publication date: 1-Jan-2002.

    https://doi.org/10.1006/jagm.2001.1202

  • Oommen B and Rueda L. (2001). Histogram methods in query optimization: the relation between accuracy and optimality Proceedings Seventh International Conference on Database Systems for Advanced Applications. DASFAA 2001. 10.1109/DASFAA.2001.916393. 0-7695-0996-7. (320-326).

    http://ieeexplore.ieee.org/document/916393/

  • Makino K, Uno Y and Ibaraki T. (2001). On Minimum Edge Ranking Spanning Trees. Journal of Algorithms. 38:2. (411-437). Online publication date: 1-Feb-2001.

    https://doi.org/10.1006/jagm.2000.1143

  • Amer-Yahia S and Johnson T. Optimizing Queries on Compressed Bitmaps. Proceedings of the 26th International Conference on Very Large Data Bases. (329-338).

    /doi/10.5555/645926.671874

  • Avnur R and Hellerstein J. (2000). Eddies. ACM SIGMOD Record. 29:2. (261-272). Online publication date: 1-Jun-2000.

    https://doi.org/10.1145/335191.335420

  • Avnur R and Hellerstein J. Eddies. Proceedings of the 2000 ACM SIGMOD international conference on Management of data. (261-272).

    https://doi.org/10.1145/342009.335420

  • Kossmann D and Stocker K. (2000). Iterative dynamic programming. ACM Transactions on Database Systems. 25:1. (43-82). Online publication date: 1-Mar-2000.

    https://doi.org/10.1145/352958.352982

  • Bodorik P and Riordon J. Heuristic algorithms for distributed query processing. Proceedings of the first international symposium on Databases in parallel and distributed systems. (144-155).

    /doi/10.5555/62597.62614

  • Bowman I and Paulley G. Join enumeration in a memory-constrained environment 16th International Conference on Data Engineering. 10.1109/ICDE.2000.839482. 0-7695-0506-6. (645-654).

    http://ieeexplore.ieee.org/document/839482/

  • Lencevicius R. (2000). References. Advanced Debugging Methods. 10.1007/978-1-4419-8774-7_9. (145-160).

    http://link.springer.com/10.1007/978-1-4419-8774-7_9

  • Manegold S, Pellenkoft A and Kersten M. (2000). A Multi-Query Optimizer for Monet. Advances in Databases. 10.1007/3-540-45033-5_4. (36-50).

    http://link.springer.com/10.1007/3-540-45033-5_4

  • Mayr T and Seshadri P. Client-site query extensions. Proceedings of the 1999 ACM SIGMOD international conference on Management of data. (347-358).

    https://doi.org/10.1145/304182.304213

  • Mayr T and Seshadri P. (1999). Client-site query extensions. ACM SIGMOD Record. 28:2. (347-358). Online publication date: 1-Jun-1999.

    https://doi.org/10.1145/304181.304213

  • Czajkowski G, Mayr T, Seshadri P and von Eicken T. Resource control for java database extensions. Proceedings of the 5th conference on USENIX Conference on Object-Oriented Technologies & Systems - Volume 5. (7-7).

    /doi/10.5555/1267991.1267998

  • Nagamochi H and Ibaraki T. (1999). Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time. Journal of Algorithms. 30:2. (253-301). Online publication date: 1-Feb-1999.

    https://doi.org/10.1006/jagm.1998.0983

  • Yerneni R, Li C, Ullman J and Garcia-Molina H. (1999). Optimizing Large Join Queries in Mediation Systems. Database Theory — ICDT’99. 10.1007/3-540-49257-7_22. (348-364).

    http://link.springer.com/10.1007/3-540-49257-7_22

  • Makino K, Uno Y and Ibaraki T. (1999). On Minimum Edge Ranking Spanning Trees. Mathematical Foundations of Computer Science 1999. 10.1007/3-540-48340-3_36. (398-409).

    http://link.springer.com/10.1007/3-540-48340-3_36

  • Hellerstein J. (1998). Optimization techniques for queries with expensive methods. ACM Transactions on Database Systems. 23:2. (113-157). Online publication date: 1-Jun-1998.

    https://doi.org/10.1145/292481.277627

  • Subramanian D and Subramanian K. (1998). Query Optimization in Multidatabase Systems. Distributed and Parallel Databases. 6:2. (183-210). Online publication date: 1-Apr-1998.

    https://doi.org/10.1023/A:1008691331104

  • YU M and SHEU P. (1998). ADAPTIVE QUERY OPTIMIZATION IN DYNAMIC DATABASES. International Journal on Artificial Intelligence Tools. 10.1142/S0218213098000020. 07:01. (1-30). Online publication date: 1-Mar-1998.

    http://www.worldscientific.com/doi/abs/10.1142/S0218213098000020

  • Makino K and Ibaraki T. (1998). A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. Journal of Algorithms. 26:2. (291-305). Online publication date: 1-Feb-1998.

    https://doi.org/10.1006/jagm.1997.0896

  • Fegaras L. (1998). A new heuristic for optimizing large queries. Database and Expert Systems Applications. 10.1007/BFb0054528. (726-735).

    http://link.springer.com/10.1007/BFb0054528

  • Lencevicius R, Hölzle U and Singh A. (1997). Query-based debugging of object-oriented programs. ACM SIGPLAN Notices. 32:10. (304-317). Online publication date: 9-Oct-1997.

    https://doi.org/10.1145/263700.263752

  • Lencevicius R, Hölzle U and Singh A. Query-based debugging of object-oriented programs. Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications. (304-317).

    https://doi.org/10.1145/263698.263752

  • Ribeiro C, Ribeiro C and Lanzelotte R. (1997). Query Optimization in Distributed Relational Databases. Journal of Heuristics. 3:1. (5-23). Online publication date: 1-Sep-1997.

    https://doi.org/10.1023/A:1009670031749

  • Steinbrunn M, Moerkotte G and Kemper A. (1997). Heuristic and randomized optimization for the join ordering problem. The VLDB Journal — The International Journal on Very Large Data Bases. 6:3. (191-208). Online publication date: 8-Aug-1997.

    https://doi.org/10.1007/s007780050040

  • Scheufele W and Moerkotte G. On the complexity of generating optimal plans with cross products (extended abstract). Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems. (238-248).

    https://doi.org/10.1145/263661.263687

  • Evrendilek C, Dogac A, Nural S and Ozcan F. (1997). Multidatabase Query Optimization. Distributed and Parallel Databases. 5:1. (77-114). Online publication date: 1-Jan-1997.

    https://doi.org/10.1023/A:1008674905987

  • Yu M and Sheu P. (1997). Adaptive Join Algorithms in Dynamic Distributed Databases. Distributed and Parallel Databases. 5:1. (5-30). Online publication date: 1-Jan-1997.

    https://doi.org/10.1023/A:1008619705079

  • Aberer K, Che D and Böhm K. (1997). Rule-based generation of logical query plans with controlled complexity. Deductive and Object-Oriented Databases. 10.1007/3-540-63792-3_28. (399-416).

    http://link.springer.com/10.1007/3-540-63792-3_28

  • Chawathe S, Rajaraman A, Garcia-Molina H and Widom J. (1996). Change detection in hierarchically structured information. ACM SIGMOD Record. 25:2. (493-504). Online publication date: 1-Jun-1996.

    https://doi.org/10.1145/235968.233366

  • Hull R and Zhou G. (1996). A framework for supporting data integration using the materialized and virtual approaches. ACM SIGMOD Record. 25:2. (481-492). Online publication date: 1-Jun-1996.

    https://doi.org/10.1145/235968.233365

  • Colby L, Griffin T, Libkin L, Mumick I and Trickey H. (1996). Algorithms for deferred view maintenance. ACM SIGMOD Record. 25:2. (469-480). Online publication date: 1-Jun-1996.

    https://doi.org/10.1145/235968.233364

  • Ross K, Srivastava D and Sudarshan S. (1996). Materialized view maintenance and integrity constraint checking. ACM SIGMOD Record. 25:2. (447-458). Online publication date: 1-Jun-1996.

    https://doi.org/10.1145/235968.233361

  • Seshadri P, Hellerstein J, Pirahesh H, Leung T, Ramakrishnan R, Srivastava D, Stuckey P and Sudarshan S. (1996). Cost-based optimization for magic. ACM SIGMOD Record. 25:2. (435-446). Online publication date: 1-Jun-1996.

    https://doi.org/10.1145/235968.233360

  • Chaudhuri S and Gravano L. (1996). Optimizing queries over multimedia repositories. ACM SIGMOD Record. 25:2. (91-102). Online publication date: 1-Jun-1996.

    https://doi.org/10.1145/235968.233323

  • Vance B and Maier D. (1996). Rapid bushy join-order optimization with Cartesian products. ACM SIGMOD Record. 25:2. (35-46). Online publication date: 1-Jun-1996.

    https://doi.org/10.1145/235968.233317

  • Seshadri P, Hellerstein J, Pirahesh H, Leung T, Ramakrishnan R, Srivastava D, Stuckey P and Sudarshan S. Cost-based optimization for magic. Proceedings of the 1996 ACM SIGMOD international conference on Management of data. (435-446).

    https://doi.org/10.1145/233269.233360

  • Chaudhuri S and Gravano L. Optimizing queries over multimedia repositories. Proceedings of the 1996 ACM SIGMOD international conference on Management of data. (91-102).

    https://doi.org/10.1145/233269.233323

  • Vance B and Maier D. Rapid bushy join-order optimization with Cartesian products. Proceedings of the 1996 ACM SIGMOD international conference on Management of data. (35-46).

    https://doi.org/10.1145/233269.233317

  • Matysiak M. (1995). Efficient optimization of large join queries using Tabu Search. Information Sciences: an International Journal. 83:1-2. (77-88). Online publication date: 1-Mar-1995.

    https://doi.org/10.1016/0020-0255(94)00094-R

  • Lin X and Orlowska M. (1995). An efficient processing of a chain join with the minimum communication cost in distributed database systems. Distributed and Parallel Databases. 3:1. (69-83). Online publication date: 1-Jan-1995.

    https://doi.org/10.1007/BF01263657

  • Mitschang B. (1995). Literatur. Anfrageverarbeitung in Datenbanksystemen. 10.1007/978-3-322-84936-6_9. (391-402).

    http://link.springer.com/10.1007/978-3-322-84936-6_9

  • Cluet S and Moerkotte G. (1995). On the complexity of generating optimal left-deep processing trees with cross products. Database Theory — ICDT '95. 10.1007/3-540-58907-4_6. (54-67).

    http://link.springer.com/10.1007/3-540-58907-4_6

  • Hellerstein J. (1994). Practical predicate placement. ACM SIGMOD Record. 23:2. (325-335). Online publication date: 1-Jun-1994.

    https://doi.org/10.1145/191843.191904

  • Lanzelotte R, Valduriez P, Zaït M and Ziane M. (1994). Industrial-strength parallel query optimization: Issues and lessons. Information Systems. 10.1016/0306-4379(94)90017-5. 19:4. (311-330). Online publication date: 1-Jun-1994.

    http://linkinghub.elsevier.com/retrieve/pii/0306437994900175

  • Hellerstein J. Practical predicate placement. Proceedings of the 1994 ACM SIGMOD international conference on Management of data. (325-335).

    https://doi.org/10.1145/191839.191904

  • Lin E, Omiecinski E and Yalamanchili S. (1994). Large Join Optimization on a Hypercube Multiprocessor. IEEE Transactions on Knowledge and Data Engineering. 6:2. (304-315). Online publication date: 1-Apr-1994.

    https://doi.org/10.1109/69.277773

  • Morzy T, Matysiak M and Salza S. (1994). Tabu search optimization of large join queries. Advances in Database Technology — EDBT '94. 10.1007/3-540-57818-8_60. (309-322).

    http://link.springer.com/10.1007/3-540-57818-8_60

  • Tay Y. (1993). On the optimality of strategies for multiple join. Journal of the ACM. 40:5. (1067-1086). Online publication date: 1-Nov-1993.

    https://doi.org/10.1145/174147.174151

  • Orlowska M. (1993). Effective utilization of copies in a transparent distributed environment. Distributed and Parallel Databases. 1:4. (409-425). Online publication date: 1-Oct-1993.

    https://doi.org/10.1007/BF01264015

  • Kemper A, Moerkotte G and Peithner K. A Blackboard Architecture for Query Optimization in Object Bases. Proceedings of the 19th International Conference on Very Large Data Bases. (543-554).

    /doi/10.5555/645919.672667

  • Hellerstein J and Stonebraker M. (1993). Predicate migration. ACM SIGMOD Record. 22:2. (267-276). Online publication date: 1-Jun-1993.

    https://doi.org/10.1145/170036.170078

  • Hellerstein J and Stonebraker M. Predicate migration. Proceedings of the 1993 ACM SIGMOD international conference on Management of data. (267-276).

    https://doi.org/10.1145/170035.170078

  • Swami A and Iyer B. A polynomial time algorithm for optimizing join queries IEEE 9th International Conference on Data Engineering. 10.1109/ICDE.1993.344047. 0-8186-3570-3. (345-354).

    http://ieeexplore.ieee.org/document/344047/

  • Singh S and Mehndiratta S. Parallel processing for multirelational queries Canadian Conference on Electrical and Computer Engineering. 10.1109/CCECE.1993.332347. 0-7803-1443-3. (493-496).

    http://ieeexplore.ieee.org/document/332347/

  • Nanni U, Salza S and Terranova M. The LOGIDATA+ prototype system. LOGIDATA+: Deductive Databases with Complex Objects. 10.1007/BFb0021899. (211-232).

    http://www.springerlink.com/index/10.1007/BFb0021899

  • Kerschberg L and Waisanen A. (1993). A cooperative approach to query processing: Integrating historical, structural, and behavioral knowledge sources. Artificial Intelligence and Symbolic Mathematical Computing. 10.1007/3-540-57322-4_15. (214-223).

    http://link.springer.com/10.1007/3-540-57322-4_15

  • Bodorik P, Riordan J and Pyra J. (1992). Deciding to Correct Distributed Query Processing. IEEE Transactions on Knowledge and Data Engineering. 4:3. (253-265). Online publication date: 1-Jun-1992.

    https://doi.org/10.1109/69.142016

  • Ranganathan N, Balaji K and Srinidhi H. (1992). A VLSI systolic array processor chip for computing joins in a relational database. Microprocessors & Microsystems. 16:5. (227-236). Online publication date: 1-Jun-1992.

    https://doi.org/10.1016/0141-9331(92)90065-2

  • Cheiney J and Lanzelotte R. A model for optimizing deductive and object-oriented DB requests [1992] Eighth International Conference on Data Engineering. 10.1109/ICDE.1992.213171. 0-8186-2545-7. (385-392).

    http://ieeexplore.ieee.org/document/213171/

  • Lanzelotte R and Valduriez P. Extending the Search Strategy in a Query Optimizer. Proceedings of the 17th International Conference on Very Large Data Bases. (363-373).

    /doi/10.5555/645917.672305

  • Sundaresh R. (1991). Building incremental programs using partial evaluation. ACM SIGPLAN Notices. 26:9. (83-93). Online publication date: 1-Sep-1991.

    https://doi.org/10.1145/115866.115875

  • Sherman D, Strandh R and Durand I. (1991). Optimization of equational programs using partial evaluation. ACM SIGPLAN Notices. 26:9. (72-82). Online publication date: 1-Sep-1991.

    https://doi.org/10.1145/115866.115874

  • Smith D. (1991). Partial evaluation of pattern matching in constraint logic programming languages. ACM SIGPLAN Notices. 26:9. (62-71). Online publication date: 1-Sep-1991.

    https://doi.org/10.1145/115866.115873

  • Ioannidis Y and Kang Y. (1991). Left-deep vs. bushy trees. ACM SIGMOD Record. 20:2. (168-177). Online publication date: 1-Apr-1991.

    https://doi.org/10.1145/119995.115813

  • Ioannidis Y and Kang Y. Left-deep vs. bushy trees. Proceedings of the 1991 ACM SIGMOD international conference on Management of data. (168-177).

    https://doi.org/10.1145/115790.115813

  • Fotouhi F, Leigh J and Rana S. (1991). Optimal parallel scheduling of M-way join queries. Information Systems. 10.1016/0306-4379(91)90023-3. 16:6. (627-639). Online publication date: 1-Jan-1991.

    http://linkinghub.elsevier.com/retrieve/pii/0306437991900233

  • Benzschawel S, Gehlen E, Ley M, Ludwig T, Maier A and Walter B. (1991). LILOG-DB: Database support for knowledge based systems. Text Understanding in LILOG. 10.1007/3-540-54594-8_79. (501-594).

    http://link.springer.com/10.1007/3-540-54594-8_79

  • Bodorik P, Pyra J and Riordon J. Correcting execution of distributed queries. Proceedings of the second international symposium on Databases in parallel and distributed systems. (192-201).

    https://doi.org/10.1145/319057.319098

  • Tay Y. On the optimality of strategies for multiple joins. Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems. (124-131).

    https://doi.org/10.1145/298514.298550

  • Whang K and Krishnamurthy R. (1990). Query optimization in a memory-resident domain relational calculus database system. ACM Transactions on Database Systems. 15:1. (67-95). Online publication date: 1-Mar-1990.

    https://doi.org/10.1145/77643.77646

  • Bodorik P, Pyra J and Riordon J. Correcting execution of distributed queries Second International Symposium on Databases in Parallel and Distributed Systems. 10.1109/DPDS.1990.113710. 0-8186-2052-8. (192-201).

    http://ieeexplore.ieee.org/document/113710/

  • Swami A and Gupta A. (1988). Optimization of large join queries. ACM SIGMOD Record. 17:3. (8-17). Online publication date: 1-Jun-1988.

    https://doi.org/10.1145/971701.50203

  • Swami A and Gupta A. Optimization of large join queries. Proceedings of the 1988 ACM SIGMOD international conference on Management of data. (8-17).

    https://doi.org/10.1145/50202.50203

  • Bodorik P and Riordon J. A threshold mechanism for distributed query processing. Proceedings of the 1988 ACM sixteenth annual conference on Computer science. (616-625).

    https://doi.org/10.1145/322609.323136

  • Bodorik P and Riordon J. Distributed query processing optimization objectives Proceedings. Fourth International Conference on Data Engineering. 10.1109/ICDE.1988.105475. 0-8186-0827-7. (320-329).

    http://ieeexplore.ieee.org/document/105475/

  • Bodorik P. Heuristic Algorithms For Distributed Query Processing [1988] International Symposium on Databases in Parallel and Distributed Systems. 10.1109/DPDS.1988.675011. 0-8186-0893-5. (144-155).

    http://ieeexplore.ieee.org/document/675011/

  • Bodorik P and Riordon J. Evaluation dynamic processing of distributed queries [1988] Proceedings. The 8th International Conference on Distributed. 10.1109/DCS.1988.12554. 0-8186-0865-X. (510-519).

    http://ieeexplore.ieee.org/document/12554/

  • Miyao J, Tominaga K, Kikuno T and Yoshida N. (2007). Optimization of Multiple Queries in Relational Database Systems. Systems and Computers in Japan. 10.1002/scj.4690190406. 19:4. (56-65). Online publication date: 1-Jan-1988.

    https://onlinelibrary.wiley.com/doi/10.1002/scj.4690190406

  • Krishnamurthy R, Boral H and Zaniolo C. Optimization of Nonrecursive Queries. Proceedings of the 12th International Conference on Very Large Data Bases. (128-137).

    /doi/10.5555/645913.671481