{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:11:18Z","timestamp":1725487878436},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540140405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-39205-x_104","type":"book-chapter","created":{"date-parts":[[2007,7,21]],"date-time":"2007-07-21T18:23:13Z","timestamp":1185042193000},"page":"627-630","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Aggregate Queries with Guaranteed Error Bounds"],"prefix":"10.1007","author":[{"given":"Seok-Ju","family":"Chun","sequence":"first","affiliation":[]},{"given":"Ju-Hong","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Seok-Lyong","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"104_CR1","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger: The R*-tree: an efficient and robust access method for points and rectangles. Proc. of ACM SIGMOD Conference (1990) 322\u2013331","DOI":"10.1145\/93597.98741"},{"key":"104_CR2","unstructured":"Seok-Ju Chun, Chin-Wan Chung, Ju-Hong Lee, and Seok-Lyong Lee: Dynamic Update Cube for Range-Sum Queries. Proc. of VLDB Conference (2001) 521\u2013530"},{"key":"104_CR3","doi-asserted-by":"crossref","unstructured":"C. Ho, R. Agrawal, N. Megido, R. Srikant: Range queries in OLAP Data Cubes. Proc. of ACM SIGMOD Conference (1997) 73\u201388","DOI":"10.1145\/253260.253274"},{"key":"104_CR4","doi-asserted-by":"crossref","unstructured":"L. Lazaridis, and S. Mehrotra: Progressive Approximate Aggregate Queries with a Multi-Resolution Tree Structure. Proc. of ACM SIGMOD Conference (2001) 401\u2013412","DOI":"10.1145\/375663.375718"},{"key":"104_CR5","doi-asserted-by":"crossref","unstructured":"M. Riedewald, D. Agrawal, and A. E. Abbadi: pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds. Proc. of SSDBM Conference (2000) 95\u2013108","DOI":"10.1109\/SSDM.2000.869781"}],"container-title":["Lecture Notes in Computer Science","Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39205-X_104.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:20:43Z","timestamp":1619572843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39205-X_104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540140405"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-39205-x_104","relation":{},"subject":[]}}