{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:41Z","timestamp":1725566681505},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540285663"},{"type":"electronic","value":"9783540317296"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11546924_8","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:09:19Z","timestamp":1127830159000},"page":"75-84","source":"Crossref","is-referenced-by-count":0,"title":["Evaluating Mid-(k, n) Queries Using B\u2009+\u2009-Tree"],"prefix":"10.1007","author":[{"given":"Dongseop","family":"Kwon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taewon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sukho","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D.: Ubiquitous b-tree. ACM Computing Surveys\u00a011, 121\u2013137 (1979)","journal-title":"ACM Computing Surveys"},{"key":"8_CR2","unstructured":"Carey, M.J., Kossmann, D.: Reducing the braking distance of an sql query engine. In: Proceedings of 24th Int\u2019l. Conf. on Very Large Data Bases, pp. 158\u2013169 (1998)"},{"key":"8_CR3","unstructured":"Donjerkovic, D., Ramakrishnan, R.: Probabilistic optimization of top n queries. In: Proceedings of 25th Int\u2019l. Conf. on Very Large Data Bases, pp. 411\u2013422 (1999)"},{"key":"8_CR4","unstructured":"Chaudhuri, S., Gravano, L.: Evaluating top-k selection queries. In: Proceedings of 25th Int\u2019l. Conf. on Very Large Data Bases, pp. 397\u2013410 (1999)"},{"key":"8_CR5","unstructured":"Chen, C.M., Ling, Y.: A sampling-based estimator for top-k query. In: Proceedings of the 18th Int\u2019l. Conf. on Data Engineering, pp. 617\u2013627 (2002)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. Journal of Computer and System Sciences\u00a07, 448\u2013461 (1973)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR7","unstructured":"Alsabti, K., Ranka, S., Singh, V.: A one-pass algorithm for accurately estimating quantiles for disk-resident data. In: Proceedings of 23rd Int\u2019l. Conf. on Very Large Data Bases, pp. 346\u2013355 (1997)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Rajagopalan, S., Lindsay, B.G.: Approximate medians and other quantiles in one pass and with limited memory. In: Proceedings of the 1998 ACM SIGMOD Int\u2019l. Conf. on Management of Data, pp. 426\u2013435 (1998)","DOI":"10.1145\/276305.276342"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11546924_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:07:46Z","timestamp":1558307266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11546924_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285663","9783540317296"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11546924_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}