{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T01:20:40Z","timestamp":1648603240797},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0169-023x(95)00009-h","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"51-72","source":"Crossref","is-referenced-by-count":0,"title":["An integrated data structure with multiple access paths for database systems and its performance"],"prefix":"10.1016","volume":"16","author":[{"given":"Vijay","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Judy","family":"Mullins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0169-023X(95)00009-H_BIB1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00263762","article-title":"Concurrency of operations on B-trees","volume":"9","author":"Bayer","year":"1977","journal-title":"Acta Informatica"},{"key":"10.1016\/0169-023X(95)00009-H_BIB2","series-title":"Proc. 6th ACM Symp. on Principles of Database Systems","first-page":"159","article-title":"Operation specific locking in B-trees","author":"Biliris","year":"1987"},{"key":"10.1016\/0169-023X(95)00009-H_BIB3","series-title":"Proc. 2nd IFIP Conf. on Visual Databases","first-page":"130","article-title":"An integrated data structure with multiple access paths","author":"Burger","year":"1992"},{"issue":"2","key":"10.1016\/0169-023X(95)00009-H_BIB4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","article-title":"The ubiquitous B-tree","volume":"11","author":"Comer","year":"1979","journal-title":"ACM Comput. Surveys"},{"issue":"11","key":"10.1016\/0169-023X(95)00009-H_BIB5","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1145\/360363.360369","article-title":"The notions of consistency and predicate locks in database systems","volume":"19","author":"Eswaran","year":"1976","journal-title":"Commun. ACM"},{"issue":"3","key":"10.1016\/0169-023X(95)00009-H_BIB6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","article-title":"Extendible hashing: A fast access method for dynamic files","volume":"4","author":"Fagin","year":"1979","journal-title":"ACM Trans. Database Syst."},{"issue":"12","key":"10.1016\/0169-023X(95)00009-H_BIB7","first-page":"147","article-title":"A superior two-phase locking algorithm and its performance","volume":"54","author":"Kumar","year":"1990","journal-title":"Informat. Sci."},{"issue":"4","key":"10.1016\/0169-023X(95)00009-H_BIB8","doi-asserted-by":"crossref","DOI":"10.1145\/319628.319663","article-title":"Efficient locking for concurrent operations on B-trees","volume":"6","author":"Lehman","year":"1981","journal-title":"ACM TODS"},{"key":"10.1016\/0169-023X(95)00009-H_BIB9","series-title":"Probability and Random Processes for Electrical Engineering","author":"Leon-Garcia","year":"1989"},{"key":"10.1016\/0169-023X(95)00009-H_BIB10","article-title":"ARIS\/IM: An efficient and high concurrency index management method using write-ahead logging","author":"Mohan","year":"1989","journal-title":"IBM Research Report, RJ 6846"},{"key":"10.1016\/0169-023X(95)00009-H_BIB11","series-title":"Proc. 7th Int. Conf. on VLDB","first-page":"331","article-title":"Concurrency control in B+-trees database using preparatory operations","author":"Mond","year":"1985"},{"key":"10.1016\/0169-023X(95)00009-H_BIB12","series-title":"Proc. ACM Computer Science Conf.","first-page":"57","article-title":"An integrated data structure with multiple access paths for database systems","author":"Mullins","year":"1992"},{"issue":"1","key":"10.1016\/0169-023X(95)00009-H_BIB13","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","article-title":"The grid file: An adaptable, symmetry multikey file structure","volume":"9","author":"Nivergelt","year":"1984","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"10.1016\/0169-023X(95)00009-H_BIB14","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1145\/320251.320260","article-title":"System level concurrency control for distributed database systems","volume":"3","author":"Rosencrantz","year":"1978","journal-title":"ACM TODS"},{"key":"10.1016\/0169-023X(95)00009-H_BIB15","series-title":"Proc. 4th ACM Symp. on Principles of Data Syste,s","first-page":"28","article-title":"Concurrent operations on B+-trees with overtaking","author":"Sagiv","year":"1985"},{"issue":"3","key":"10.1016\/0169-023X(95)00009-H_BIB16","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0306-4379(86)90031-1","article-title":"Grid file concurrency","volume":"11","author":"Salzberg","year":"1986","journal-title":"Information. Syst."},{"key":"10.1016\/0169-023X(95)00009-H_BIB17","article-title":"Concurrent algorithms for search structures","author":"Shasha","year":"1984"},{"issue":"2","key":"10.1016\/0169-023X(95)00009-H_BIB18","article-title":"what good are concurrent search structures for database anyway?","volume":"8","author":"Shasha","year":"1985","journal-title":"Database Eng."},{"key":"10.1016\/0169-023X(95)00009-H_BIB19","series-title":"Schaum's Outline of Theory and Problems of Statistics","author":"Spiegel","year":"1988"},{"key":"10.1016\/0169-023X(95)00009-H_BIB20","series-title":"SPSS for Windows","year":"1992"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X9500009H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X9500009H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T22:25:50Z","timestamp":1556144750000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0169023X9500009H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["0169023X9500009H"],"URL":"https:\/\/doi.org\/10.1016\/0169-023x(95)00009-h","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}