Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Linear Hash Tables"'
Autor:
Manuk G. Manukyan, Grigor R. Gevorgyan
Publikováno v:
Современные информационные технологии и IT-образование, Vol 14, Iss 1, Pp 111-125 (2018)
We present a new dynamic index structure for multidimensional data. The considered index structure is based on an extended grid file concept. Strengths and weaknesses of the grid files were analyzed. Based on that analysis we proposed to strengthen t
Externí odkaz:
https://doaj.org/article/0a3ebcc60cb842c8b091fbe64fe6cf4d
Autor:
WALZER, STEFAN
Publikováno v:
ACM Transactions on Algorithms; Jul2023, Vol. 19 Issue 3, p1-22, 22p
Publikováno v:
IEEE/ACM Transactions on Networking; Oct2020, Vol. 28 Issue 5, p2350-2363, 14p
Publikováno v:
Applied Sciences (2076-3417); 3/15/2020, Vol. 10 Issue 6, p1915, 18p
Autor:
Hyvönen, Jörkki1 (AUTHOR) jjhyvone@lce.hut.fi, Saramäki, Jari1 (AUTHOR), Kaski, Kimmo1 (AUTHOR)
Publikováno v:
International Journal of Computer Mathematics. Aug2008, Vol. 85 Issue 8, p1219-1233. 15p. 2 Diagrams, 1 Chart, 4 Graphs.
Autor:
Sleaton, Daniel, Larson, Per-Ake
Publikováno v:
Communications of the ACM; Apr88, Vol. 31 Issue 4, p446-457, 12p, 5 Diagrams, 8 Charts
Autor:
Fritchie, Scott Lystig
Publikováno v:
Proceedings of the 2003 ACM SIGPLAN Workshop: Erlang; 8/29/2003, p43-55, 13p
Publikováno v:
Proceedings of 1994 IEEE 10th International Conference on Data Engineering; 1994, p120-131, 12p
Publikováno v:
Journal of Computers. 9
To maintain the continuing growth of bit density in magnetic recording media, the disk industry will have to change technologies. Shingled write disks are expected to be the next generation of high capacity magnetic disks and alreadyin prototype. Shi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::538c79135cdf9578c41e7e5433f27f3f
https://doi.org/10.4304/jcp.9.10.2247-2257
https://doi.org/10.4304/jcp.9.10.2247-2257
Autor:
Scott Lystig Fritchie
Publikováno v:
Erlang Workshop
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables based on four data structures: AVL balanced binary trees, B-trees, res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4ba1ff2dc64bcdecf84a4a533e7cb58
https://doi.org/10.1145/940880.940887
https://doi.org/10.1145/940880.940887