Skip to content

Commit

Permalink
add one Paper about Isolation Level
Browse files Browse the repository at this point in the history
  • Loading branch information
@paul356
paul356 committed May 28, 2024
1 parent d255d4c commit f6ce758
Show file tree
Hide file tree
Showing 2 changed files with 15 additions and 11 deletions.
16 changes: 9 additions & 7 deletions _org/2024-05-17-may-papers.org
View file
Original file line number Diff line number Diff line change
Expand Up @@ -8,10 +8,12 @@ nav_order: {{ page.date }}
---
#+END_EXPORT

|----------------------------------------------------------------------------------------------+---------------------------------------------------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+----------------+-------------------------------------------------------|
| Title | Authors | Synthesis | Publisher | Keywords |
|----------------------------------------------------------------------------------------------+---------------------------------------------------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+----------------+-------------------------------------------------------|
| The R*-tree: An Efficient and Robust AccessMethod for Points and Rectangles+ | Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger | R-Tree is a popular tree structure for managing spatial shapes. In the origional paper [[http://www-db.deis.unibo.it/courses/SI-LS/papers/Gut84.pdf][Gut84]]. The origion algorithm is framed that minimum area increase is set as the only criteria. But it is showed in some cases the origional algorithm will generate bad results. Reconsider the criterias of a R-Tree with optimal retrieval performance this paper introduces a new algorithm for steps ChooseSubTree and QudraticSplit. The result show it can improve the retrieval performance and robustness at the cost of slightly increasing the insert cost. | SIGMOD 90 | R-Tree |
| ALECE: An Attention-based Learned Cardinality Estimator for SPJ Queries on Dynamic Workloads | Pengfei Li, Wenqing Wei, Rong Zhu, Bolin Ding, Jingren Zhou, Hua Lu | ALECE is another learned based cardinality estimator which learns from true cardinalities. It takes featurized data distribution and queries as input. With two attention structures, one self attention for data features and one cross attention between data features and query features, it can achieve much better estimate than competitors. | VLDB 2023 | Cardinality Estimation, Attention |
| The Transaction Concept: Virtues and Limitations | Jim Gray | This technical report introduces where transactions evolves from. It also introduces the general transaction model, and how to implement transactions. Two methods are time-domain addressing and logging and locking. It also discusses some of the issues with current transaction implementations, for example, nested transactions and long living transactions. | Tandem TR 81.3 | Transaction, Time-Domain Address, Logging and Locking |
|----------------------------------------------------------------------------------------------+---------------------------------------------------------------------------+---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+----------------+-------------------------------------------------------|
|----------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------+-------------------------------------------------------------------------------------------------------------------+----------------+-----------------------------------------------------------|
| Title | Authors | Synthesis | Publisher | Keywords |
|----------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------+-------------------------------------------------------------------------------------------------------------------+----------------+-----------------------------------------------------------|
| The R*-tree: An Efficient and Robust AccessMethod for Points and Rectangles+ | Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger | R-Tree is a popular tree structure for managing spatial shapes. In the origional paper [[http://www-db.deis.unibo.it/courses/SI-LS/papers/Gut84.pdf][Gut84]]. The origion algorithm is framed that minimum area increase is set as the only criteria. But it is showed in some cases the origional algorithm will generate bad results. Reconsider the criterias of a R-Tree with optimal retrieval performance this paper introduces a new algorithm for steps ChooseSubTree and QudraticSplit. The result show it can improve the retrieval performance and robustness at the cost of slightly increasing the insert cost. | SIGMOD 90 | R-Tree |
| ALECE: An Attention-based Learned Cardinality Estimator for SPJ Queries on Dynamic Workloads | Pengfei Li, Wenqing Wei, Rong Zhu, Bolin Ding, Jingren Zhou, Hua Lu | ALECE is another learned based cardinality estimator which learns from true cardinalities. It takes featurized data distribution and queries as input. With two attention structures, one self attention for data features and one cross attention between data features and query features, it can achieve much better estimate than competitors. | VLDB 2023 | Cardinality Estimation, Attention |
| The Transaction Concept: Virtues and Limitations | Jim Gray | This technical report introduces where transactions evolves from. It also introduces the general transaction model, and how to implement transactions. Two methods are time-domain addressing and logging and locking. It also discusses some of the issues with current transaction implementations, for example, nested transactions and long living transactions. | Tandem TR 81.3 | Transaction, Time-Domain Address, Logging and Locking |
| A Critique of ANSI SQL Isolation Levels | Hal Berenson, Phil Bernstein, Jim Gray, Jim Melton, Elizabeth O'Neil, Patrick O'Neil | This technical report redefine the isolation levels defined by ANSI SQL standards. It add the missing phenomena *Dirty Write* and fix the loose phenomena defintions. Result is a new table for isolation levels, Read Uncommitted, Read Committed, Repeatable Read, Serializable. Plus it also introduce the other isolation levels, and how to achieve Serializable with Snapshot Isolation + First Committer Wins strategy. | SIGMOD 1995 | Isolation Level, Snapshot Isolation, First Committer Wins |
| | | | | |
|----------------------------------------------------------------------------------------------+--------------------------------------------------------------------------------------+-------------------------------------------------------------------------------------------------------------------+----------------+-----------------------------------------------------------|
10 changes: 6 additions & 4 deletions _posts/2024-05-17-may-papers.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,9 @@ tags: [R-Tree]
nav_order: {{ page.date }}
---

| Title | Authors | Synthesis | Publisher | Keywords |
| The R\*-tree: An Efficient and Robust AccessMethod for Points and Rectangles+ | Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger | R-Tree is a popular tree structure for managing spatial shapes. In the origional paper [Gut84](http://www-db.deis.unibo.it/courses/SI-LS/papers/Gut84.pdf). The origion algorithm is framed that minimum area increase is set as the only criteria. But it is showed in some cases the origional algorithm will generate bad results. Reconsider the criterias of a R-Tree with optimal retrieval performance this paper introduces a new algorithm for steps ChooseSubTree and QudraticSplit. The result show it can improve the retrieval performance and robustness at the cost of slightly increasing the insert cost. | SIGMOD 90 | R-Tree |
| ALECE: An Attention-based Learned Cardinality Estimator for SPJ Queries on Dynamic Workloads | Pengfei Li, Wenqing Wei, Rong Zhu, Bolin Ding, Jingren Zhou, Hua Lu | ALECE is another learned based cardinality estimator which learns from true cardinalities. It takes featurized data distribution and queries as input. With two attention structures, one self attention for data features and one cross attention between data features and query features, it can achieve much better estimate than competitors. | VLDB 2023 | Cardinality Estimation, Attention |
| The Transaction Concept: Virtues and Limitations | Jim Gray | This technical report introduces where transactions evolves from. It also introduces the general transaction model, and how to implement transactions. Two methods are time-domain addressing and logging and locking. It also discusses some of the issues with current transaction implementations, for example, nested transactions and long living transactions. | Tandem TR 81.3 | Transaction, Time-Domain Address, Logging and Locking |
| Title | Authors | Synthesis | Publisher | Keywords |
| The R\*-tree: An Efficient and Robust AccessMethod for Points and Rectangles+ | Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger | R-Tree is a popular tree structure for managing spatial shapes. In the origional paper [Gut84](http://www-db.deis.unibo.it/courses/SI-LS/papers/Gut84.pdf). The origion algorithm is framed that minimum area increase is set as the only criteria. But it is showed in some cases the origional algorithm will generate bad results. Reconsider the criterias of a R-Tree with optimal retrieval performance this paper introduces a new algorithm for steps ChooseSubTree and QudraticSplit. The result show it can improve the retrieval performance and robustness at the cost of slightly increasing the insert cost. | SIGMOD 90 | R-Tree |
| ALECE: An Attention-based Learned Cardinality Estimator for SPJ Queries on Dynamic Workloads | Pengfei Li, Wenqing Wei, Rong Zhu, Bolin Ding, Jingren Zhou, Hua Lu | ALECE is another learned based cardinality estimator which learns from true cardinalities. It takes featurized data distribution and queries as input. With two attention structures, one self attention for data features and one cross attention between data features and query features, it can achieve much better estimate than competitors. | VLDB 2023 | Cardinality Estimation, Attention |
| The Transaction Concept: Virtues and Limitations | Jim Gray | This technical report introduces where transactions evolves from. It also introduces the general transaction model, and how to implement transactions. Two methods are time-domain addressing and logging and locking. It also discusses some of the issues with current transaction implementations, for example, nested transactions and long living transactions. | Tandem TR 81.3 | Transaction, Time-Domain Address, Logging and Locking |
| A Critique of ANSI SQL Isolation Levels | Hal Berenson, Phil Bernstein, Jim Gray, Jim Melton, Elizabeth O'Neil, Patrick O'Neil | This technical report redefine the isolation levels defined by ANSI SQL standards. It add the missing phenomena **Dirty Write** and fix the loose phenomena defintions. Result is a new table for isolation levels, Read Uncommitted, Read Committed, Repeatable Read, Serializable. Plus it also introduce the other isolation levels, and how to achieve Serializable with Snapshot Isolation + First Committer Wins strategy. | SIGMOD 1995 | Isolation Level, Snapshot Isolation, First Committer Wins |
| | | | | |

0 comments on commit f6ce758

Please sign in to comment.