Παρακαλώ χρησιμοποιήστε αυτό το αναγνωριστικό για να παραπέμψετε ή να δημιουργήσετε σύνδεσμο προς αυτό το τεκμήριο:
https://ruomo.lib.uom.gr/handle/7000/1248
Πλήρης εγγραφή μεταδεδομένων
Πεδίο DC | Τιμή | Γλώσσα |
---|---|---|
dc.contributor.author | Evangelidis, Georgios | - |
dc.contributor.author | Lomet, David B. | - |
dc.contributor.author | Salzberg, Betty | - |
dc.date.accessioned | 2022-08-30T11:59:34Z | - |
dc.date.available | 2022-08-30T11:59:34Z | - |
dc.date.issued | 1995 | - |
dc.identifier.uri | http://www.vldb.org/conf/1995/P551.PDF | en_US |
dc.identifier.uri | https://ruomo.lib.uom.gr/handle/7000/1248 | - |
dc.description.abstract | We describe a new access method, the hB\Pi-tree, an adaptation of the hB-tree index to the constraints of the Pi-tree. The Pi-trees, a generalization of the B link-trees, provide high concurrency with recovery, because they break down structure modification into a series of short atomic actions. In addition, the IItrees include a node consolidation algorithm. The hB-tree is, a multi-attribute index which is highly insensitive to dimensionality, but which has no node consolidation algorithm and has a flaw in its split/post algorithm in certain special cases. The hB\Pi-tree corrects the splitting/posting algorithm and adapts the concurrency, recovery and node consolidation of the Pi-tree to the hB-tree. The combination makes the hB\Pi-tree suitable for inclusion in a general purpose database management system.supporting multi-attribute and spatial queries. | en_US |
dc.language.iso | en | en_US |
dc.rights | Attribution-NonCommercial-ShareAlike 4.0 International | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | * |
dc.subject | FRASCATI::Natural sciences::Computer and information sciences | en_US |
dc.subject.other | indexing | en_US |
dc.subject.other | B-trees | en_US |
dc.subject.other | multi-attribute access methods | en_US |
dc.subject.other | spatial access methods | en_US |
dc.subject.other | concurrency | en_US |
dc.subject.other | recovery | en_US |
dc.title | The hBP-tree - A Modified hB-tree Supporting Concurrency, Recoveryand Node Consolidation | en_US |
dc.type | Conference Paper | en_US |
dc.contributor.department | Τμήμα Εφαρμοσμένης Πληροφορικής | en_US |
local.identifier.firstpage | 551 | en_US |
local.identifier.lastpage | 561 | en_US |
local.identifier.volumetitle | VLDB'95, Proceedings of 21th International Conference on Very LargeData Bases, September 11-15, 1995, Zurich, Switzerland | en_US |
Εμφανίζεται στις Συλλογές: | Τμήμα Εφαρμοσμένης Πληροφορικής |
Αρχεία σε αυτό το Τεκμήριο:
Αρχείο | Περιγραφή | Μέγεθος | Μορφότυπος | |
---|---|---|---|---|
1995_vldb_openaccess.pdf | 1,16 MB | Adobe PDF | Προβολή/Ανοιγμα |
Αυτό το τεκμήριο προστατεύεται από Αδεια Creative Commons