diff --git a/_org/2024-02-02-feb-papers.org b/_org/2024-02-02-feb-papers.org index 20c9ed2..e66d9ca 100644 --- a/_org/2024-02-02-feb-papers.org +++ b/_org/2024-02-02-feb-papers.org @@ -12,6 +12,6 @@ nav_order: {{ page.date }} | Title | Authors | Synthesis | Publisher | Keywords | |------------------------------------------------------------------+-----------------------------------------------------------------------------------+-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+-----------------------+----------------------------------------| | Access Path Selection in a Relational Database Management System | P. Griffiths Selinger, M. M. Astrahan, D. D. Chamberlin, R. R. Lorie, T. G. Price | This paper present a framework for selecting the access path for single table scans and n-table joins. This method first emurates the different single relation scan plans, next it emurates second-level joins from the single relation plans, then enumerate third-level joins until all tables are in the join plans. In order to reduce the plans considered it introduces some heuristics to do early pruning favoring joins with high selectivity factors. | SIGMOD 1979 | Access Path Selection, Query Optimizer | -| A Relational Model of Data for Large Shared Data Banks | Edgar F. Codd | This paper proposes to use relational model for data management systems. It defines the notion of Relation, and operations applicable to Relations. It also suggests seperating the sublanguage of data into R and H. R is a high level language to descirbe the characteristics of the data set. H is taken care of by the implementers of data systems. This paper also touches some aspects of schema design and data redundancy. | Information Retrieval | Relational Model 1970 | +| A Relational Model of Data for Large Shared Data Banks | Edgar F. Codd | This paper proposes to use relational model for data management systems. It defines the notion of Relation, and operations applicable to Relations. It also suggests seperating the sublanguage of data into R and H. R is a high level language to descirbe the characteristics of the data set. H is taken care of by the implementers of data systems. This paper introduces the operations can be used on relations, like permutations, projections, and joins. It also touches some aspects of schema design and data redundancy. | Information Retrieval | Relational Model 1970 | | | | | | | |------------------------------------------------------------------+-----------------------------------------------------------------------------------+-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+-----------------------+----------------------------------------| diff --git a/_posts/2024-02-02-feb-papers.md b/_posts/2024-02-02-feb-papers.md index 9681b89..7fb00ed 100644 --- a/_posts/2024-02-02-feb-papers.md +++ b/_posts/2024-02-02-feb-papers.md @@ -5,7 +5,7 @@ tags: [Query Optimization, Learned Query Optimizer, Machine Learning for Databas nav_order: {{ page.date }} --- -| Title | Authors | Synthesis | Publisher | Keywords | -| Access Path Selection in a Relational Database Management System | P. Griffiths Selinger, M. M. Astrahan, D. D. Chamberlin, R. R. Lorie, T. G. Price | This paper present a framework for selecting the access path for single table scans and n-table joins. This method first emurates the different single relation scan plans, next it emurates second-level joins from the single relation plans, then enumerate third-level joins until all tables are in the join plans. In order to reduce the plans considered it introduces some heuristics to do early pruning favoring joins with high selectivity factors. | SIGMOD 1979 | Access Path Selection, Query Optimizer | -| A Relational Model of Data for Large Shared Data Banks | Edgar F. Codd | This paper proposes to use relational model for data management systems. It defines the notion of Relation, and operations applicable to Relations. It also suggests seperating the sublanguage of data into R and H. R is a high level language to descirbe the characteristics of the data set. H is taken care of by the implementers of data systems. This paper also touches some aspects of schema design and data redundancy. | Information Retrieval | Relational Model 1970 | -| | | | | | +| Title | Authors | Synthesis | Publisher | Keywords | +| Access Path Selection in a Relational Database Management System | P. Griffiths Selinger, M. M. Astrahan, D. D. Chamberlin, R. R. Lorie, T. G. Price | This paper present a framework for selecting the access path for single table scans and n-table joins. This method first emurates the different single relation scan plans, next it emurates second-level joins from the single relation plans, then enumerate third-level joins until all tables are in the join plans. In order to reduce the plans considered it introduces some heuristics to do early pruning favoring joins with high selectivity factors. | SIGMOD 1979 | Access Path Selection, Query Optimizer | +| A Relational Model of Data for Large Shared Data Banks | Edgar F. Codd | This paper proposes to use relational model for data management systems. It defines the notion of Relation, and operations applicable to Relations. It also suggests seperating the sublanguage of data into R and H. R is a high level language to descirbe the characteristics of the data set. H is taken care of by the implementers of data systems. This paper introduces the operations can be used on relations, like permutations, projections, and joins. It also touches some aspects of schema design and data redundancy. | Information Retrieval | Relational Model 1970 | +| | | | | |