|
|
Deletion in coalesced hashing
Mrkva, Lukáš ; Koubková, Alena (advisor) ; Skopal, Tomáš (referee)
Nazev pracc: Opcra.ee DELETE ve srustajicim luisovani Autor: Lukas Mrkva Katedra (listav): Katedra softwaroveho inzenyrstvi Vedouci diplomovc prace: R.NDr. Alona Koubkova, CSc. E-rnail vedouciho: koubkova@ksi.ms.mff.cuni.cz Abstrakt: Diplomova pnioe jo vcnovana opcraci DELETE vo srustajicim hasovani. Nejprve jsou uvodeny principy hasovani a nektere jeho zakladni druhy. O srnstajicim hasovani pojednava ka])itola 3, kde jsou podrobnc ]>o- psany i ruznc melody koikstrukce h;usovaoi tal)ulky ro/dekuio die pofadi ko- liznich zaznamu a pfitonniosti sklepa. Dale jsou ])fcdstaveny tri rozdilne al- goritmy pro opora.ci DKLI^TK a dctailne diskutovtiny jojich implnincntacc pro jcdnutlivo inotody srustajiciho ha.sova.ni. Po tooroticke cayti naslcdiiji vy- slodky a koinontafo oxpcriincntu na siniulovanych datodi. Pracr jc zainefcna zejmena na porovnani casovu narooiiosti jednotlivych mazacich algoritnm a na porovnani ca.su potfcl)nych k vyhlcdavani za'/nanm prod a po smazani cast! tabulky. Pouzito algoritiny iiu])lciu(1iitovane v ja/yco C' a vyslodky ex- pcrimcntn jsou ]>rilozouy na CD. Klfcova slova: srustajici hasovani. delcto Title: Deletion in Coalesced Hashing Author: Lukas Mrkva Department: Dopartnicnt of Software Engineering Supervisor: RXDr. Aleua Koulikova,CSc. Supervisor's e-mail address:...
|
|
|
Deletion in coalesced hashing
Mrkva, Lukáš ; Koubková, Alena (advisor) ; Skopal, Tomáš (referee)
This diploma thesis deals with operation DELETE in coalesced hashing. First of all we talk about principles of hashing itself and we describe some basic types of hashing. Chapter 3 is devoted to coalesced hashing and creating the corresponding hash table using di erent inserting methods with or without cellar presence. Then, three algorithms for deleting records form hash table are introduced. Their implementaion is discussed in detail for every inserting method of coalesced hashing. Simulated data experiments follow the theoretical part of the thesis. They are focused on comparing time consumption of the delete algorithms as well as search performance before/after delete. The presented algorithms are implemented in C language and are available on enclosed CD together with the measured results.
|
|
|
Deletion in coalesced hashing
Mrkva, Lukáš ; Skopal, Tomáš (referee) ; Koubková, Alena (advisor)
Nazev pracc: Opcra.ee DELETE ve srustajicim luisovani Autor: Lukas Mrkva Katedra (listav): Katedra softwaroveho inzenyrstvi Vedouci diplomovc prace: R.NDr. Alona Koubkova, CSc. E-rnail vedouciho: koubkova@ksi.ms.mff.cuni.cz Abstrakt: Diplomova pnioe jo vcnovana opcraci DELETE vo srustajicim hasovani. Nejprve jsou uvodeny principy hasovani a nektere jeho zakladni druhy. O srnstajicim hasovani pojednava ka])itola 3, kde jsou podrobnc ]>o- psany i ruznc melody koikstrukce h;usovaoi tal)ulky ro/dekuio die pofadi ko- liznich zaznamu a pfitonniosti sklepa. Dale jsou ])fcdstaveny tri rozdilne al- goritmy pro opora.ci DKLI^TK a dctailne diskutovtiny jojich implnincntacc pro jcdnutlivo inotody srustajiciho ha.sova.ni. Po tooroticke cayti naslcdiiji vy- slodky a koinontafo oxpcriincntu na siniulovanych datodi. Pracr jc zainefcna zejmena na porovnani casovu narooiiosti jednotlivych mazacich algoritnm a na porovnani ca.su potfcl)nych k vyhlcdavani za'/nanm prod a po smazani cast! tabulky. Pouzito algoritiny iiu])lciu(1iitovane v ja/yco C' a vyslodky ex- pcrimcntn jsou ]>rilozouy na CD. Klfcova slova: srustajici hasovani. delcto Title: Deletion in Coalesced Hashing Author: Lukas Mrkva Department: Dopartnicnt of Software Engineering Supervisor: RXDr. Aleua Koulikova,CSc. Supervisor's e-mail address:...
|
|
|
Deletion in coalesced hashing
Mrkva, Lukáš ; Koubková, Alena (advisor) ; Skopal, Tomáš (referee)
This diploma thesis deals with operation DELETE in coalesced hashing. First of all we talk about principles of hashing itself and we describe some basic types of hashing. Chapter 3 is devoted to coalesced hashing and creating the corresponding hash table using di erent inserting methods with or without cellar presence. Then, three algorithms for deleting records form hash table are introduced. Their implementaion is discussed in detail for every inserting method of coalesced hashing. Simulated data experiments follow the theoretical part of the thesis. They are focused on comparing time consumption of the delete algorithms as well as search performance before/after delete. The presented algorithms are implemented in C language and are available on enclosed CD together with the measured results.
|
guest ::
