{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T23:31:10Z","timestamp":1756683070893,"version":"3.41.0"},"reference-count":55,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2005,9]]},"abstract":"<jats:p>\n            LH*\n            <jats:sub>RS<\/jats:sub>\n            is a high-availability scalable distributed data structure (SDDS). An LH*\n            <jats:sub>RS<\/jats:sub>\n            file is hash partitioned over the distributed RAM of a multicomputer, for example, a network of PCs, and supports the unavailability of any\n            <jats:italic>k<\/jats:italic>\n            \u2265 1 of its server nodes. The value of\n            <jats:italic>k<\/jats:italic>\n            transparently grows with the file to offset the reliability decline. Only the number of the storage nodes potentially limits the file growth. The high-availability management uses a novel parity calculus that we have developed, based on Reed-Salomon erasure correcting coding. The resulting parity storage overhead is about the lowest possible. The parity encoding and decoding are faster than for any other candidate coding we are aware of. We present our scheme and its performance analysis, including experiments with a prototype implementation on Wintel PCs. The capabilities of LH*\n            <jats:sub>RS<\/jats:sub>\n            offer new perspectives to data intensive applications, including the emerging ones of grids and of P2P computing.\n          <\/jats:p>","DOI":"10.1145\/1093382.1093386","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T16:00:45Z","timestamp":1131379245000},"page":"769-811","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["LH*\n            <sub>RS<\/sub>\n            ---a highly-available scalable distributed data structure"],"prefix":"10.1145","volume":"30","author":[{"given":"Witold","family":"Litwin","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris Dauphine, Paris, France"}]},{"given":"Rim","family":"Moussa","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Dauphine, Paris, France"}]},{"given":"Thomas","family":"Schwarz","sequence":"additional","affiliation":[{"name":"Santa Clara University, Santa Clara, CA"}]}],"member":"320","published-online":{"date-parts":[[2005,9]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/264107.264132"},{"key":"e_1_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Anderson D. and Kubiatowicz J. 2002. The Worldwide Computer. In Scientific American 286 3 March.]]  Anderson D. and Kubiatowicz J. 2002. The Worldwide Computer. In Scientific American 286 3 March.]]","DOI":"10.1038\/scientificamerican0302-40"},{"key":"e_1_2_2_3_1","unstructured":"The Boxwood Project. http:\/\/research.microsoft.com\/research\/sv\/Boxwood\/.]]  The Boxwood Project. http:\/\/research.microsoft.com\/research\/sv\/Boxwood\/.]]"},{"key":"e_1_2_2_4_1","volume-title":"Internet: D-day at eBay. Yahoo INDIVIDUAL INVESTOR ONLINE, (July 19).]]","author":"Bartalos G.","year":"1999","unstructured":"Bartalos , G. 1999 . Internet: D-day at eBay. Yahoo INDIVIDUAL INVESTOR ONLINE, (July 19).]] Bartalos, G. 1999. Internet: D-day at eBay. Yahoo INDIVIDUAL INVESTOR ONLINE, (July 19).]]"},{"key":"e_1_2_2_5_1","unstructured":"Bertino E. Ooi B. C. Sacks-Davis R. Tan K. L. Zobel J. Shidlovsky B. and Catania B. 1999. Indexing Techniques for Advanced Database Systems. Kluver.]]   Bertino E. Ooi B. C. Sacks-Davis R. Tan K. L. Zobel J. Shidlovsky B. and Catania B. 1999. Indexing Techniques for Advanced Database Systems. Kluver.]]"},{"key":"e_1_2_2_6_1","unstructured":"Bennour F. Di&enegrave; A. Ndiaye Y. and Litwin W. 2000. Scalable and distributed linear hashing LH&ast;LH under Windows NT. In SCI-2000 (Systemics Cybernetics and Informatics) Orlando Florida.]]  Bennour F. Di&enegrave; A. Ndiaye Y. and Litwin W. 2000. Scalable and distributed linear hashing LH&ast;LH under Windows NT. In SCI-2000 (Systemics Cybernetics and Informatics) Orlando Florida.]]"},{"key":"e_1_2_2_7_1","volume-title":"Distributed Data and Structures 4 (Proceedings of WDAS","author":"Bennour F.","year":"2002","unstructured":"Bennour , F. 2002. Performance of the SDDS LH&ast;LH under SDDS-2000 . In Distributed Data and Structures 4 (Proceedings of WDAS 2002 ), Carleton Scientific , 1--12.]] Bennour, F. 2002. Performance of the SDDS LH&ast;LH under SDDS-2000. In Distributed Data and Structures 4 (Proceedings of WDAS 2002), Carleton Scientific, 1--12.]]"},{"volume-title":"Proceedings of the 22nd International Symposium on Fault Tolerant Computing, Toulouse, 432--441","author":"Burkhard W. A.","key":"e_1_2_2_8_1","unstructured":"Burkhard , W. A. and Menon , J . 1993. Disk array storage system reliability . In Proceedings of the 22nd International Symposium on Fault Tolerant Computing, Toulouse, 432--441 .]] Burkhard, W. A. and Menon, J. 1993. Disk array storage system reliability. In Proceedings of the 22nd International Symposium on Fault Tolerant Computing, Toulouse, 432--441.]]"},{"key":"e_1_2_2_9_1","volume-title":"Advanced Transact-SQL For SQL Server","author":"Ben-Gan I.","year":"2000","unstructured":"Ben-Gan , I. , and Moreau , T . Advanced Transact-SQL For SQL Server 2000 . 2003. Apress , ISBN 1-8931115-82-8.]] Ben-Gan, I., and Moreau, T. Advanced Transact-SQL For SQL Server 2000. 2003. Apress, ISBN 1-8931115-82-8.]]"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00119338"},{"volume-title":"1st Workshop on Distributed Data and Structures (WDAS '98)","author":"Breitbart Y.","key":"e_1_2_2_11_1","unstructured":"Breitbart , Y. and Vingralek , R . 1998. Addressing and balancing issues in distributed B&plus; trees . In 1st Workshop on Distributed Data and Structures (WDAS '98) , Carleton-Scientific.]] Breitbart, Y. and Vingralek, R. 1998. Addressing and balancing issues in distributed B&plus; trees. In 1st Workshop on Distributed Data and Structures (WDAS '98), Carleton-Scientific.]]"},{"key":"e_1_2_2_12_1","unstructured":"Com. ACM. 1997. Special Issue on High-Performance Computing (Oct).]]  Com. ACM. 1997. Special Issue on High-Performance Computing (Oct).]]"},{"key":"e_1_2_2_13_1","unstructured":"CERIA Home page: http:\/\/ceria.dauphine.fr\/]]  CERIA Home page: http:\/\/ceria.dauphine.fr\/]]"},{"key":"e_1_2_2_14_1","unstructured":"http:\/\/www.contingencyplanningresearch.com\/cod.htm. 1996. Cost of a downtime Study.]]  http:\/\/www.contingencyplanningresearch.com\/cod.htm. 1996. Cost of a downtime Study.]]"},{"volume-title":"Workshop on Design Issues in Anonymity and Unobservability (July).]]","author":"Dingledine R.","key":"e_1_2_2_15_1","unstructured":"Dingledine , R. , Freedman , M. , and Molnar , D . 2000. The free haven project: Distributed anonymous storage service . Workshop on Design Issues in Anonymity and Unobservability (July).]] Dingledine, R., Freedman, M., and Molnar, D. 2000. The free haven project: Distributed anonymous storage service. Workshop on Design Issues in Anonymity and Unobservability (July).]]"},{"key":"e_1_2_2_16_1","unstructured":"Donoghue A. Boldly 2003. Googling into the future. http:\/\/insight.zdnet.co.uk\/internet\/ecommerce\/0 39020454 39116781 00.htm]]  Donoghue A. Boldly 2003. Googling into the future. http:\/\/insight.zdnet.co.uk\/internet\/ecommerce\/0 39020454 39116781 00.htm]]"},{"key":"e_1_2_2_17_1","unstructured":"Economist 2003. Moving up the stack. www.economist.com.May.]]  Economist 2003. Moving up the stack. www.economist.com.May.]]"},{"volume-title":"Distributed Data Structures for Internet Service Construction. 4th Symposium on Operating Systems Design and Implementation (OSDI'00)","author":"Gribble S.","key":"e_1_2_2_18_1","unstructured":"Gribble , S. , Brewer , E., A. , Hellerstein , J. , and Culler , D . 2000. Scalable , Distributed Data Structures for Internet Service Construction. 4th Symposium on Operating Systems Design and Implementation (OSDI'00) .]] Gribble, S., Brewer, E., A., Hellerstein, J., and Culler, D. 2000. Scalable, Distributed Data Structures for Internet Service Construction. 4th Symposium on Operating Systems Design and Implementation (OSDI'00).]]"},{"volume-title":"Data Mining of SDDS SkyServer Database. International Workshop on Distributed Data Structures, (WDAS'02)","author":"Gray J.","key":"e_1_2_2_19_1","unstructured":"Gray , J. , Szalay , A. S. , Ihakar , A. , Kunszt , P. S. , Stoughton , C. , Slutz , D. R. , and van den Berg, J. 2002 . Data Mining of SDDS SkyServer Database. International Workshop on Distributed Data Structures, (WDAS'02) , Carleton Scientific.]] Gray, J., Szalay, A. S., Ihakar, A., Kunszt, P. S., Stoughton, C., Slutz, D. R., and van den Berg, J. 2002. Data Mining of SDDS SkyServer Database. International Workshop on Distributed Data Structures, (WDAS'02), Carleton Scientific.]]"},{"key":"e_1_2_2_20_1","volume-title":"The Tiger Shark File System. COMPCON-96","author":"Haskin R.","year":"1996","unstructured":"Haskin , R. and Schmuck , F . 1996 . The Tiger Shark File System. COMPCON-96 , 1996 .]] Haskin, R. and Schmuck, F. 1996. The Tiger Shark File System. COMPCON-96, 1996.]]"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185210"},{"key":"e_1_2_2_22_1","volume-title":"The art of computer programming","author":"Knuth D.","unstructured":"Knuth , D. 1998. The art of computer programming . Vol. 3 Sorting and searching. 2 nd Ed. Addison-Wesley , 780.]] Knuth, D. 1998. The art of computer programming. Vol. 3 Sorting and searching. 2nd Ed. Addison-Wesley, 780.]]","edition":"2"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/606272.606297"},{"key":"e_1_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Karlson J. Litwin W. and \n      Risch T\n  . \n  1996\n  . LH&ast;LH: A scalable high performance data structure for switched multicomputers. In Apers P. Gardarin G. Bouzeghoub M. (eds.) Extending Database Technology EDBT96 Lecture Notes in Computer Science vol. \n  1057\n  . \n  Springer Verlag\n  .]]   Karlson J. Litwin W. and Risch T. 1996. LH&ast;LH: A scalable high performance data structure for switched multicomputers. In Apers P. Gardarin G. Bouzeghoub M. (eds.) Extending Database Technology EDBT96 Lecture Notes in Computer Science vol. 1057. Springer Verlag.]]","DOI":"10.1007\/BFb0014179"},{"key":"e_1_2_2_25_1","volume-title":"Linkoping","author":"Lindberg R.","year":"1997","unstructured":"Lindberg , R. 1997 . A Java Implementation of a Highly Available Scalable and Distributed Data Structure LH&ast;g. Master Th. LiTH-IDA-Ex-97\/65. U . Linkoping , 1997\/62.]] Lindberg, R. 1997. A Java Implementation of a Highly Available Scalable and Distributed Data Structure LH&ast;g. Master Th. LiTH-IDA-Ex-97\/65. U. Linkoping, 1997\/62.]]"},{"key":"e_1_2_2_26_1","volume-title":"Linear hashing: A new tool for file and table addressing. Reprinted from VLDB80 in Readings in Databases, edited by M. Stonebraker","author":"Litwin W.","unstructured":"Litwin , W. 1994. Linear hashing: A new tool for file and table addressing. Reprinted from VLDB80 in Readings in Databases, edited by M. Stonebraker , 2 nd Edition, Morgan Kaufmann Publishers .]] Litwin, W. 1994. Linear hashing: A new tool for file and table addressing. Reprinted from VLDB80 in Readings in Databases, edited by M. Stonebraker, 2nd Edition, Morgan Kaufmann Publishers.]]","edition":"2"},{"key":"e_1_2_2_27_1","first-page":"260","volume-title":"International Conference on Databases. Aberdeen","author":"Litwin W.","year":"1980","unstructured":"Litwin , W. 1980 . Linear hashing: A new algorithm for files and tables addressing . International Conference on Databases. Aberdeen , Heyden , p. 260 -- 275 .]] Litwin, W. 1980. Linear hashing: A new algorithm for files and tables addressing. International Conference on Databases. Aberdeen, Heyden, p. 260--275.]]"},{"key":"e_1_2_2_28_1","unstructured":"Litwin W. Neimat M.-A. Levy G. Ndiaye S. and Seck T. 1997. LH&ast;S: A high-availability and high-security Scalable Distributed Data Structure. IEEE-Res. Issues in Data Eng. (RIDE-97).]]   Litwin W. Neimat M.-A. Levy G. Ndiaye S. and Seck T. 1997. LH&ast;S: A high-availability and high-security Scalable Distributed Data Structure. IEEE-Res. Issues in Data Eng. (RIDE-97).]]"},{"key":"e_1_2_2_29_1","unstructured":"Litwin W. Menon J. and Risch T. 1998. LH&ast; with Scalable Availability. IBM Almaden Res. Rep. RJ 10121 (91937) (May).]]  Litwin W. Menon J. and Risch T. 1998. LH&ast; with Scalable Availability. IBM Almaden Res. Rep. RJ 10121 (91937) (May).]]"},{"volume-title":"DIMACS Workshop on Distributed Data and Structures, Princeton U. Carleton Scientific.]]","author":"Litwin W.","key":"e_1_2_2_30_1","unstructured":"Litwin , W. , Menon , J. , Risch , T. , and Schwarz , T . 1999. Design Issues For Scalable Availability LH&ast; Schemes with Record Grouping . DIMACS Workshop on Distributed Data and Structures, Princeton U. Carleton Scientific.]] Litwin, W., Menon, J., Risch, T., and Schwarz, T. 1999. Design Issues For Scalable Availability LH&ast; Schemes with Record Grouping. DIMACS Workshop on Distributed Data and Structures, Princeton U. Carleton Scientific.]]"},{"key":"e_1_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Litwin W. Moussa R. and Schwarz T. 2004a. LH&ast;RS: A Highly Available Distributed Data Storage System. Research Prototype Demonstration. VLDB Toronto.]]  Litwin W. Moussa R. and Schwarz T. 2004a. LH&ast;RS: A Highly Available Distributed Data Storage System. Research Prototype Demonstration. VLDB Toronto.]]","DOI":"10.1016\/B978-012088469-8\/50129-7"},{"key":"e_1_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Litwin W. Moussa R. and Schwarz T. 2004b. LH&ast;RS: A Highly Available Distributed Data Storage System. CERIA Tech. Rep. (Dec).]]  Litwin W. Moussa R. and Schwarz T. 2004b. LH&ast;RS: A Highly Available Distributed Data Storage System. CERIA Tech. Rep. (Dec).]]","DOI":"10.1016\/B978-012088469-8\/50129-7"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170084"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/236711.236713"},{"key":"e_1_2_2_35_1","volume-title":"-A","author":"Litwin W.","year":"1996","unstructured":"Litwin , W. and Neimat , M . -A . 1996 . High-Availability LH&ast; Schemes with Mirroring, International Conference on Cooperating Information Systems, (COOPIS) IEEE Press .]] Litwin, W. and Neimat, M.-A. 1996. High-Availability LH&ast; Schemes with Mirroring, International Conference on Cooperating Information Systems, (COOPIS) IEEE Press.]]"},{"key":"e_1_2_2_36_1","unstructured":"Litwin W. and Risch T. 1997. LH&ast;g: A High-availability Scalable Distributed Data Structure through Record Grouping. Res. Rep. CERIA U. Dauphine and U. Linkoping (May).]]  Litwin W. and Risch T. 1997. LH&ast;g: A High-availability Scalable Distributed Data Structure through Record Grouping. Res. Rep. CERIA U. Dauphine and U. Linkoping (May).]]"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1019223"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335418"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1019223"},{"key":"e_1_2_2_40_1","unstructured":"Ljungstr&omuml; M. 2000. Implementing LH&ast;RS: A scalable distributed highly-available data structure Master Thesis Feb. CS Dep. U. Linkoping Sweden.]]  Ljungstr&omuml; M. 2000. Implementing LH&ast;RS: A scalable distributed highly-available data structure Master Thesis Feb. CS Dep. U. Linkoping Sweden.]]"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258573"},{"key":"e_1_2_2_42_1","unstructured":"MaCwilliams F. J. and Sloane N. J. A. 1997. The Theory of Error Correcting Codes. Elsevier\/North Holland Amsterdam.]]  MaCwilliams F. J. and Sloane N. J. A. 1997. The Theory of Error Correcting Codes. Elsevier\/North Holland Amsterdam.]]"},{"key":"e_1_2_2_43_1","volume-title":"Carleton Scientific (Records of WDAS","author":"Moussa R.","year":"2003","unstructured":"Moussa , R. 2003 . In Distributed Data and Structures 4 , Carleton Scientific (Records of WDAS 2002, Paris).]] Moussa, R. 2003. In Distributed Data and Structures 4, Carleton Scientific (Records of WDAS 2002, Paris).]]"},{"key":"e_1_2_2_44_1","unstructured":"Moussa R. 2004. Experimental Performance Analysis of LH&ast;RS. CERIA Res. Rep. {CERIA}.]]  Moussa R. 2004. Experimental Performance Analysis of LH&ast;RS. CERIA Res. Rep. {CERIA}.]]"},{"key":"e_1_2_2_45_1","volume-title":"Records of the 4th International Meeting (WDAS","author":"Moussa R.","year":"2002","unstructured":"Moussa , R. and Litwin , W . 2002. Experimental performance analysis of LH&ast;RS parity management. Distributed Data and Structures 4 , Records of the 4th International Meeting (WDAS 2002 ), Paris, France.]] Moussa, R. and Litwin, W. 2002. Experimental performance analysis of LH&ast;RS parity management. Distributed Data and Structures 4, Records of the 4th International Meeting (WDAS 2002), Paris, France.]]"},{"key":"e_1_2_2_46_1","volume-title":"Proceedings of the Workshop on Hardware and Software Architectures for Fault Tolerance. Mt. St. Michel, Fr. June.]]","author":"P\u00e2ris J. F.","year":"1993","unstructured":"P\u00e2ris , J. F. 1993 . The management of replicated data . In Proceedings of the Workshop on Hardware and Software Architectures for Fault Tolerance. Mt. St. Michel, Fr. June.]] P\u00e2ris, J. F. 1993. The management of replicated data. In Proceedings of the Workshop on Hardware and Software Architectures for Fault Tolerance. Mt. St. Michel, Fr. June.]]"},{"volume-title":"Database Management Systems","author":"Ramakrishnan R.","key":"e_1_2_2_47_1","unstructured":"Ramakrishnan , R. 1999. Database Management Systems . McGraw Hill .]] Ramakrishnan, R. 1999. Database Management Systems. McGraw Hill.]]"},{"key":"e_1_2_2_48_1","unstructured":"RFC 793---Transmission Control Protocol http:\/\/www.faqs.org\/rfcs\/rfc793.html]]  RFC 793---Transmission Control Protocol http:\/\/www.faqs.org\/rfcs\/rfc793.html]]"},{"volume-title":"Annual Interantional Symposium on Fault Tolerant Computing.]]","author":"Sabaratnam M.","key":"e_1_2_2_49_1","unstructured":"Sabaratnam M. , Torbjornsen , and Hvasshovd, S . -O. 1999. Evaluating the effectiveness of fault tolerance in replicated database management systems. 29th . Annual Interantional Symposium on Fault Tolerant Computing.]] Sabaratnam M., Torbjornsen, and Hvasshovd, S.-O. 1999. Evaluating the effectiveness of fault tolerance in replicated database management systems. 29th. Annual Interantional Symposium on Fault Tolerant Computing.]]"},{"key":"e_1_2_2_50_1","volume-title":"Generalized Reed Solomon Codes for Erasure Correction in SDDS. Workshop on Distributed Data and Structure 4, WDAS-4","author":"Schwarz T.","year":"2003","unstructured":"Schwarz , T. 2003 . Generalized Reed Solomon Codes for Erasure Correction in SDDS. Workshop on Distributed Data and Structure 4, WDAS-4 , Paris. Carleton Scientific.]] Schwarz, T. 2003. Generalized Reed Solomon Codes for Erasure Correction in SDDS. Workshop on Distributed Data and Structure 4, WDAS-4, Paris. Carleton Scientific.]]"},{"key":"e_1_2_2_51_1","unstructured":"SDDS-Bibliography. http:\/\/192.134.119.81\/SDDS-bibliograhie.html http:\/\/ceria.dauphine.fr\/witold.html]]  SDDS-Bibliography. http:\/\/192.134.119.81\/SDDS-bibliograhie.html http:\/\/ceria.dauphine.fr\/witold.html]]"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008609030195"},{"volume-title":"1st International Workshop on Peer-to-Peer systems, IPTPS-2002","author":"Weatherspoon H.","key":"e_1_2_2_53_1","unstructured":"Weatherspoon , H. and Kubiatowicz , J . 2002. Erasure coding vs. replication: A quantitative comparison . 1st International Workshop on Peer-to-Peer systems, IPTPS-2002 . March.]] Weatherspoon, H. and Kubiatowicz, J. 2002. Erasure coding vs. replication: A quantitative comparison. 1st International Workshop on Peer-to-Peer systems, IPTPS-2002. March.]]"},{"key":"e_1_2_2_54_1","volume-title":"Reliability mechanisms for very large storage systems. 20th IEEE mass storage systems and technologies (MSST","author":"Xin Q.","year":"2003","unstructured":"Xin , Q. , Miller , E. , Schwarz , T. , Brandt , S. , Long , D. , Litwin , W. 2003. Reliability mechanisms for very large storage systems. 20th IEEE mass storage systems and technologies (MSST 2003 ), San Diego , CA. 146--156.]] Xin, Q., Miller, E., Schwarz, T., Brandt, S., Long, D., Litwin, W. 2003. Reliability mechanisms for very large storage systems. 20th IEEE mass storage systems and technologies (MSST 2003), San Diego, CA. 146--156.]]"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/1032647.1033303"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1093382.1093386","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1093382.1093386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:12Z","timestamp":1750278132000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1093382.1093386"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":55,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["10.1145\/1093382.1093386"],"URL":"https:\/\/doi.org\/10.1145\/1093382.1093386","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"type":"print","value":"0362-5915"},{"type":"electronic","value":"1557-4644"}],"subject":[],"published":{"date-parts":[[2005,9]]},"assertion":[{"value":"2005-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}