add paper digest for May 2024

paul356 · May 17, 2024 · 109b98f · 109b98f
1 parent e1dad27
commit 109b98f
Show file tree

Hide file tree

Showing 3 changed files with 25 additions and 1 deletion.
diff --git a/_org/2024-04-22-april-papers.org b/_org/2024-04-22-april-papers.org
@@ -11,5 +11,5 @@ nav_order: {{ page.date }}
 |------------------------------------------------------------------------------------+----------------------------------------------------------------------------------------+-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+-------------+----------|
 | Title                                                                              | Authors                                                                                | Synthesis                                                                                                                                                                                                         | Publisher   | Keywords |
 |------------------------------------------------------------------------------------+----------------------------------------------------------------------------------------+-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+-------------+----------|
-| Logical Physical Clocks and Consistent Snapshots in Globally Distributed Databases | Sandeep Kulkarni , Murat Demirbas , Deepak Madeppa , Bharadwaj Avva, and Marcelo Leone | Logical clock is proposed by Lamport to ordering events in a distributed system, but it is not possible to relate logical clock to physical time. HLS is proposed to combine the advantage of logical clock and physical time, and it don't need the special hardware used in TrueTime and also have low space overhead. It builds on NTP and logical clock. It can be deployed in the cloud environment or private data centers which have NTP servers. It can be used to create consistent snapshots in distributed systems. | OPODIS 2014 | Logical Physical Clock, Logical Clock   |
+| Logical Physical Clocks and Consistent Snapshots in Globally Distributed Databases | Sandeep Kulkarni , Murat Demirbas , Deepak Madeppa , Bharadwaj Avva, and Marcelo Leone | Logical clock is proposed by Lamport to ordering events in a distributed system, but it is not possible to relate logical clock to physical time. HLS is proposed to combine the advantage of logical clock and physical time, and it need not the special hardware used in TrueTime and also have low space overhead. It builds on NTP and logical clock. It can be deployed in the cloud environment or private data centers which have NTP servers. It can be used to create consistent snapshots in distributed systems.     | OPODIS 2014 | Logical Physical Clock, Logical Clock   |
 |------------------------------------------------------------------------------------+----------------------------------------------------------------------------------------+-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+-------------+----------|
diff --git a/_org/2024-05-17-may-papers.org b/_org/2024-05-17-may-papers.org
@@ -0,0 +1,15 @@
+#+OPTIONS: ^:nil
+#+BEGIN_EXPORT html
+---
+layout: default
+title: Paper Digest of May 2024
+tags: [R-Tree]
+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 at the cost of slightly increasing the insert cost. | SIGMOD 90 | R-Tree   |
+|------------------------------------------------------------------------------+---------------------------------------------------------------------------+----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+-----------+----------|
diff --git a/_posts/2024-05-17-may-papers.md b/_posts/2024-05-17-may-papers.md
@@ -0,0 +1,9 @@
+---
+layout: default
+title: Paper Digest of May 2024
+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 at the cost of slightly increasing the insert cost. | SIGMOD 90 | R-Tree   |