{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T10:57:44Z","timestamp":1778583464806,"version":"3.51.4"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1109\/tkde.2002.1019223","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T21:39:07Z","timestamp":1034977147000},"page":"923-927","source":"Crossref","is-referenced-by-count":14,"title":["LH*g: a high-availability scalable distributed data structure by record grouping"],"prefix":"10.1109","volume":"14","author":[{"given":"W.","family":"Litwin","sequence":"first","affiliation":[]},{"given":"T.","family":"Risch","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/264107.264132"},{"key":"ref2","article-title":"Scalable Distributed Linear Hashing LH*LH Under Windows NT","volume-title":"Proc. IEEE Fourth World Multiconf. Systems Cybernetics & Informatics and Information Systems Analysis & Synthesis","author":"Bennour"},{"key":"ref3","article-title":"NOW: Towards Everyday Supercomputing on a Network of Workstations","author":"Culler","year":"1994"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57301-1_7"},{"key":"ref5","article-title":"Super-Servers: Commodity Computer Clusters Pose a Software Challenge","volume-title":"Microsoft","author":"Gray","year":"1996"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1990.113499"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/210126.210131"},{"key":"ref8","article-title":"A Continuously Available and Highly Scalable Transaction Server","volume-title":"Proc. Fourth Int\u2019l Workshop High Performance Transaction Systems","author":"Hvasshovd"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014179"},{"key":"ref10","first-page":"780","article-title":"The Art of Computer Programming","volume-title":"Sorting and Searching","volume":"3","author":"Knuth","year":"1998"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191891"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ftcsh.1995.532603"},{"key":"ref13","first-page":"62","article-title":"A Java Implementation of a Highly Available Scalable and Distributed Data Structure LH*g","author":"Lindberg","year":"1997"},{"key":"ref14","article-title":"Design Issues For Scalable Availability LH* Schemes with Record Grouping","volume-title":"Proc. Workshop Distributed Data and Structures (DIMACS)","author":"Litwin"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170084"},{"key":"ref16","article-title":"RP*: A Family of Order-Preserving Scalable Distributed Data Structures","volume-title":"Proc. 20th Int\u2019l Conf. Very Large Data Bases (VLDB)","author":"Litwin"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/236711.236713"},{"key":"ref18","article-title":"$\\big. k{\\hbox{-}}{\\rm{RP}}^{\\ast}\\;_{{\\rm{N}}}\\bigr.$: A High Performance Multi-Attribute Scalable Distributed Data Structure","volume-title":"Proc. IEEE Int\u2019l Conf. Parallel and Distributed Information Systems","author":"Litwin"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/COOPIS.1996.555011"},{"key":"ref20","article-title":"$\\big. {\\rm{LH}}^{\\ast}\\;_{{\\rm{S}}}\\bigr.$: A High-Availability and High-Security Scalable Distributed Data Structure","volume-title":"IEEE-Research Issues in Data Eng., (RIDE-97)","author":"Litwin"},{"key":"ref21","article-title":"LH*g : A High-Availability Scalable Distributed Data Structure by Record Grouping","author":"Litwin","year":"1997"},{"key":"ref22","article-title":"$\\big. {\\rm{LH}}^{\\ast}\\;_{{\\rm{RS}}}\\bigr.$: A High-Availability Scalable Distributed Data Structure Using Reed Solomon Codes","volume-title":"Proc. ACM-SIGMOD-2000 Int\u2019l Conf. Management of Data","author":"Litwin"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/50202.50214"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1990.113496"},{"key":"ref25","first-page":"601","volume-title":"Distributed Operating Systems","author":"Tanenbaum","year":"1995"},{"key":"ref26","article-title":"Multi-Site Declustering Strategies for Very High Database Service Availabiity","author":"Torbjornsen","year":"1995"},{"key":"ref27","first-page":"131","article-title":"Concurrent Scalable Distributed Data Structures","volume-title":"Proc. ISCA Int\u2019l Conf. Parallel and Distributed Computing Systems","author":"Tung"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191889"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/225535.225539"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/69\/21919\/01019223.pdf?arnumber=1019223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T04:50:28Z","timestamp":1742014228000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1019223\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,7]]}},"URL":"https:\/\/doi.org\/10.1109\/tkde.2002.1019223","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}