乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T13:38:07Z","timestamp":1648647487476},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"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":["Computers & Electrical Engineering"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1016\/j.compeleceng.2011.12.009","type":"journal-article","created":{"date-parts":[[2012,1,17]],"date-time":"2012-01-17T12:00:26Z","timestamp":1326801626000},"page":"231-242","source":"Crossref","is-referenced-by-count":1,"title":["Partially persistent B-trees with constant worst-case update time"],"prefix":"10.1016","volume":"38","author":[{"given":"George","family":"Lagogiannis","sequence":"first","affiliation":[]},{"given":"Nikos","family":"Lorentzos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.compeleceng.2011.12.009_b0005","first-page":"86","article-title":"Making data structures persistent","volume":"38","author":"Driscoll","year":"1989","journal-title":"JCSS"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0010","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s00778-004-0151-3","article-title":"Indexing spatiotemporal archives","volume":"15","author":"Hadjieleftheriou","year":"2006","journal-title":"VLDB J"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0015","doi-asserted-by":"crossref","unstructured":"Park H, Son J, Kim M. An efficient spatiotemporal indexing method for moving objects in mobile communication environments. In: International conference on MDM; 2003. p. 78\u201391.","DOI":"10.1007\/3-540-36389-0_6"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0020","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/1132863.1132870","article-title":"Indexing the past, present, and anticipated future positions of moving objects","volume":"31","author":"Pelanis","year":"2006","journal-title":"ACM Trans Database Syst"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0025","doi-asserted-by":"crossref","unstructured":"Saltenis S, Jensen SC, Leutenegger TS, Lopez AM. Indexing the positions of continuously moving objects. In: SIGMOD, ACM; 2000. p. 331\u201342.","DOI":"10.1145\/335191.335427"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0030","unstructured":"Zhao HL, Xiao-Li L, Jun-Wei G, Hae-Young B. Indexing large moving objects from past to future with PCFI+-index. In: COMAD; 2005. p. 131\u20137."},{"key":"10.1016\/j.compeleceng.2011.12.009_b0035","unstructured":"Dietz P, Raman R. Persistence, amortization and randomization. In: Proceedings of the second ACM\u2013SIAM symposium on discrete algorithms (SODA); 1991. p. 78\u201388."},{"issue":"3","key":"10.1016\/j.compeleceng.2011.12.009_b0040","first-page":"238","article-title":"Partially persistent data structures of bounded degree with constant update time","volume":"3","author":"Brodal","year":"1996","journal-title":"Nord J Comput"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0045","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(94)00115-4","article-title":"A constant update time finger search tree","volume":"52","author":"Dietz","year":"1994","journal-title":"Inf Process Lett"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0050","first-page":"607","article-title":"New dynamic balanced search trees with worst case constant update time","volume":"8","author":"Lagogiannis","year":"2003","journal-title":"J Automata Lang Comb"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0055","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1142\/S0129054196000117","article-title":"A simple balanced search tree with O(1) worst-case update time","volume":"7","author":"Fleischer","year":"1996","journal-title":"Int J Found Comput Sci"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0060","doi-asserted-by":"crossref","unstructured":"Brodal GS, Lagogiannis G, Makris C, Tsakalidis A, Tsichlas K. Optimal finger search trees on the pointer machine. In: Proceedings of the 34th ACM symposium on theory of computing (STOC); 2002. p. 583\u201392.","DOI":"10.1145\/509907.509991"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0065","unstructured":"Brodal GS. Finger search trees with constant insertion time. In: Ninth annual ACM\u2013CIAM symposium on discrete algorithms (SODA); 1998. p. 540\u20139."},{"key":"10.1016\/j.compeleceng.2011.12.009_b0070","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF00299635","article-title":"A balanced search tree with O(1) worst-case update time","volume":"26","author":"Levcopoulos","year":"1988","journal-title":"Acta Inform"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0075","doi-asserted-by":"crossref","unstructured":"Lanka S, Mays E. Fully persistent B+-trees. In: Proceedings of the SIGMOD, ACM; 1991. p. 426\u201335.","DOI":"10.1145\/119995.115861"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0080","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/s007780050028","article-title":"An asymptotically optimal multiversion B-tree","volume":"5","author":"Becker","year":"1996","journal-title":"VLDB J"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0085","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1109\/69.599929","article-title":"An efficient multiversion access structure","volume":"9","author":"Varman","year":"1997","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0090","unstructured":"Clancy MJ, Knuth DE. A programming and problem-solving seminar. Technical Report STAN-CS-77-606, Department of Computer Science, Stanford University, Palo Alto; 1977."},{"key":"10.1016\/j.compeleceng.2011.12.009_b0095","doi-asserted-by":"crossref","unstructured":"Kaplan H, Shafrir N, Tarjan RE. Meldable heaps and boolean union-find. In: Proceedings of the ACM symposium on theory of computing; 2002. p. 573\u201382.","DOI":"10.1145\/509989.509990"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0100","first-page":"153","article-title":"The design of dynamic data structures","volume":"vol. 156","author":"Overmars","year":"1983"},{"key":"10.1016\/j.compeleceng.2011.12.009_b0105","doi-asserted-by":"crossref","unstructured":"Lagogiannis G, Lorentzos N. Partially persistent B-trees with constant worst case update time. In: ISCIS 2010; 2010. p. 4\u20137.","DOI":"10.1007\/978-90-481-9794-1_1"}],"container-title":["Computers & Electrical Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790611002138?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0045790611002138?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T15:51:48Z","timestamp":1561218708000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0045790611002138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["S0045790611002138"],"URL":"https:\/\/doi.org\/10.1016\/j.compeleceng.2011.12.009","relation":{},"ISSN":["0045-7906"],"issn-type":[{"value":"0045-7906","type":"print"}],"subject":[],"published":{"date-parts":[[2012,3]]}}}