{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T08:45:59Z","timestamp":1765529159898,"version":"3.48.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T00:00:00Z","timestamp":1749513600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T00:00:00Z","timestamp":1749513600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62062046"],"award-info":[{"award-number":["62062046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62262035"],"award-info":[{"award-number":["62262035"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In big data analysis, a large quantity of OLAP and aggregate queries\u00a0exists, which have much stronger semantic context relationships (e.g. drill down and roll up) than generic SQL queries. Caching query results in memory playing an important role\u00a0in accelerating data queries. Nevertheless, traditional query caching schemata neither fully utilize the features of OLAP, such as drill down and roll up semantics, nor compress the cached results, as the memory space is limited. In this paper, we propose a succinct, adaptive semantic OLAP caching, where the cache items are the cube lattice equivalence classes with only the bounds in a class stored. With further queries, the bound ranges are extended or expanded, indicating more query-answering ability which is assessed by the proposed covering capacity. The bounds of equivalence classes\u00a0that more covering capacity are preferentially preserved in caching. We further empower our cache with some inference ability to derive more new data cells without posing extra queries and develop efficient query and update algorithms. The extensive experimental evaluation is conducted on synthetic and real data sets with various parameter settings. Our cache outperforms the common caching like LRU and LFU. Furthermore, it is robust to the non-repeated-pattern queries, still with\u00a0a 30% hit ratio.<\/jats:p>","DOI":"10.1007\/s41019-025-00290-1","type":"journal-article","created":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T03:55:42Z","timestamp":1749527742000},"page":"621-638","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SOC: A Succinct Adaptive Semantic OLAP Caching"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9118-3775","authenticated-orcid":false,"given":"Jinguo","family":"You","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingrui","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenrui","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanting","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaiqi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengchen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,10]]},"reference":[{"issue":"11","key":"290_CR1","doi-asserted-by":"publisher","first-page":"2432","DOI":"10.14778\/3476249.3476292","volume":"14","author":"D Durner","year":"2021","unstructured":"Durner D, Chandramouli B, Li Y (2021) Crystal: a unified cache storage system for analytical databases. Proc VLDB Endow 14(11):2432\u20132444","journal-title":"Proc VLDB Endow"},{"key":"290_CR2","unstructured":"Zarif OE, Hassan S, Zou Y, Zuzarte C, Corvinelli V, Alhamid M (2020) Pred-cache: a predictive caching method in database systems, pp. 93\u2013102"},{"issue":"7","key":"290_CR3","doi-asserted-by":"publisher","first-page":"800","DOI":"10.14778\/3192965.3192971","volume":"11","author":"A Jindal","year":"2018","unstructured":"Jindal A, Karanasos K, Rao S, Patel H (2018) Selecting subexpressions to materialize at datacenter scale. Proc VLDB Endow 11(7):800\u2013812","journal-title":"Proc VLDB Endow"},{"issue":"12","key":"290_CR4","doi-asserted-by":"publisher","first-page":"2059","DOI":"10.14778\/3352063.3352124","volume":"12","author":"C Zhan","year":"2019","unstructured":"Zhan C, Su M, Wei C, Peng X, Lin L, Wang S, Chen Z, Li F, Pan Y, Zheng F, Chai C (2019) AnalyticDB: real-time OLAP database system at Alibaba cloud. Proc VLDB Endow 12(12):2059\u20132070","journal-title":"Proc VLDB Endow"},{"key":"290_CR5","unstructured":"Dar S, Franklin MJ, J\u00f3nsson B, Srivastava D, Tan M (1996) Semantic data caching and replacement. In: 1996 International Conference on Very Large Data Bases, pp. 330\u2013341"},{"issue":"1","key":"290_CR6","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TKDE.2003.1161590","volume":"15","author":"Q Ren","year":"2003","unstructured":"Ren Q, Dunham MH, Kumar V (2003) Semantic caching and query processing. IEEE Trans Knowl Data Eng 15(1):192\u2013210","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"290_CR7","doi-asserted-by":"crossref","unstructured":"Lakshmanan LV, Pei J, Han J (2002) Quotient cube: How to summarize the semantics of a data cube. In: 2002 International Conference on Very Large Data Bases, pp. 778\u2013789","DOI":"10.1016\/B978-155860869-6\/50074-3"},{"key":"290_CR8","first-page":"61","volume":"141","author":"T Kumar","year":"2011","unstructured":"Kumar T, Haider M, Kumar S (2011) A view recommendation greedy algorithm for materialized views selection. Commun Comput Inf Sci 141:61\u201370","journal-title":"Commun Comput Inf Sci"},{"key":"290_CR9","unstructured":"Shukla A, Deshpande P, Naughton JF (1998) Materialized view selection for multidimensional datasets. In: 1998 International Conference on Very Large Data Bases, pp. 488\u2013499"},{"key":"290_CR10","unstructured":"Wikipedia contributors: Inclusion-exclusion principle \u2014 Wikipedia, The Free Encyclopedia. (2019). https:\/\/en.wikipedia.org\/wiki\/Inclusionexclusion_principle"},{"key":"290_CR11","doi-asserted-by":"crossref","unstructured":"Lakshmanan LV, Pei J, Zhao Y (2003) QC-trees: an efficient summary structure for semantic OLAP. In: Proceedings of the 2003 ACM SIGMOD, pp. 64\u201375","DOI":"10.1145\/872757.872768"},{"key":"290_CR12","unstructured":"Kemper A, Kossmann D (1994) Dual-buffering strategies in object bases. In: 1994 International Conference on Very Large Data Bases, pp. 427\u2013438"},{"key":"290_CR13","doi-asserted-by":"crossref","unstructured":"Wu X, Li J, Zhang L, Speight E, Rajamony R, Xie Y (2009) Hybrid cache architecture with disparate memory technologies. In: International Symposium on Computer Architecture, pp. 34\u201345","DOI":"10.1145\/1555754.1555761"},{"key":"290_CR14","doi-asserted-by":"crossref","unstructured":"Godfrey P, Gryz J (1999) Answering queries by semantic caches. In: International Conference on Database and Expert Systems Applications, pp. 485\u2013498","DOI":"10.1007\/3-540-48309-8_45"},{"issue":"5","key":"290_CR15","doi-asserted-by":"publisher","first-page":"5853","DOI":"10.1007\/s12652-020-01943-x","volume":"14","author":"M Ahmad","year":"2023","unstructured":"Ahmad M, Qadir MA, Rahman A, Zagrouba R, Alhaidari FA, Ali T, Zahid F (2023) Enhanced query processing over semantic cache for cloud based relational databases. J Ambient Intell Humaniz Comput 14(5):5853\u20135871","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"290_CR16","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.jpdc.2017.04.011","volume":"110","author":"K Ma","year":"2017","unstructured":"Ma K, Bo Y, Zhe Y, Yu Z (2017) Segment access-aware dynamic semantic cache in cloud computing environment. J Parallel Distrib Comput 110:42\u201351","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"290_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1023\/A:1009726021843","volume":"1","author":"J Gray","year":"1997","unstructured":"Gray J, Chaudhuri S, Bosworth A, Layman A, Reichart D, Venkatrao M, Pellow F, Pirahesh H (1997) Data cube: a relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data Min Knowl Disc 1(1):29\u201353","journal-title":"Data Min Knowl Disc"},{"issue":"4","key":"290_CR18","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/s007780100054","volume":"10","author":"AY Halevy","year":"2001","unstructured":"Halevy AY (2001) Answering queries using views: a survey. VLDB J 10(4):270\u2013294","journal-title":"VLDB J"},{"issue":"2","key":"290_CR19","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.32604\/csse.2023.038951","volume":"47","author":"P Srinivasarao","year":"2023","unstructured":"Srinivasarao P, Satish AR (2023) A novel hybrid optimization algorithm for materialized view selection from data warehouse environments. Comput Syst Sci Eng 47(2):1527\u20131547","journal-title":"Comput Syst Sci Eng"},{"issue":"3","key":"290_CR20","doi-asserted-by":"publisher","first-page":"2050001","DOI":"10.1142\/S021884302050001X","volume":"29","author":"M Mohseni","year":"2020","unstructured":"Mohseni M, Sohrabi MK (2020) MVPP-based materialized view selection in data warehouses using simulated annealing. Int J Coop Inf Syst 29(3):2050001\u20131205000119","journal-title":"Int J Coop Inf Syst"},{"key":"290_CR21","doi-asserted-by":"crossref","unstructured":"Harinarayan V, Rajaraman A, Ullman JD (1996) Implementing data cubes efficiently. In: Proceedings of the 1996 ACM SIGMOD, pp. 205\u2013216","DOI":"10.1145\/233269.233333"},{"key":"290_CR22","doi-asserted-by":"crossref","unstructured":"Kotidis Y, Roussopoulos N (1999) DynaMat: a dynamic view management system for data warehouses. In: Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, pp. 371\u2013382","DOI":"10.1145\/304182.304215"},{"key":"290_CR23","doi-asserted-by":"crossref","unstructured":"Han Y, Li G, Yuan H, Sun J (2021) An autonomous materialized view management system with deep reinforcement learning. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE)","DOI":"10.1109\/ICDE51399.2021.00217"},{"key":"290_CR24","doi-asserted-by":"crossref","unstructured":"Beyer K, Ramakrishnan R (1999) Bottom-up computation of sparse and iceberg cube. In: Proceedings of the 1999 ACM SIGMOD, pp. 359\u2013370","DOI":"10.1145\/304182.304214"},{"key":"290_CR25","doi-asserted-by":"crossref","unstructured":"Wang W, Feng J, Lu H, Yu JX (2002) Condensed cube: an effective approach to reducing data cube size. In: Proceedings 18th International Conference on Data Engineering, pp. 155\u2013165","DOI":"10.1109\/ICDE.2002.994705"},{"key":"290_CR26","doi-asserted-by":"crossref","unstructured":"Sismanis Y, Deligiannakis A, Roussopoulos N, Kotidis Y (2002) Dwarf: Shrinking the petacube. In: Proceedings of the 2002 ACM SIGMOD, pp. 464\u2013475","DOI":"10.1145\/564691.564745"},{"key":"290_CR27","unstructured":"Barbara D, Sullivan M (1998) Quasi-Cubes: a space-efficient way to support approximate multidimensional databases. Technical report, ISSE George Mason University"},{"key":"290_CR28","doi-asserted-by":"crossref","unstructured":"Vitter JS, Wang M, Iyer B (1998) Data cube approximation and histograms via wavelets. In: Proceedings of the Seventh International Conference on Information and Knowledge Management, pp. 96\u2013104","DOI":"10.1145\/288627.288645"},{"key":"290_CR29","doi-asserted-by":"crossref","unstructured":"Kim A, Lakshmanan LVS, Srivastava D (2020) Summarizing hierarchical multidimensional data. In: 36th IEEE International Conference on Data Engineering , ICDE 2020, Dallas, TX, USA, April 20-24, 2020, pp. 877\u2013888","DOI":"10.1109\/ICDE48307.2020.00081"},{"key":"290_CR30","doi-asserted-by":"crossref","unstructured":"You J, Xi J, Zhang P, Chen H (2008) A parallel algorithm for closed cube computation. In: Seventh IEEE\/ACIS International Conference on Computer and Information Science (ICIS 2008), pp. 95\u201399","DOI":"10.1109\/ICIS.2008.63"},{"key":"290_CR31","doi-asserted-by":"crossref","unstructured":"Nandi A, Yu C, Bohannon P, Ramakrishnan R (2011) Distributed cube materialization on holistic measures. In: 2011 IEEE 27th International Conference on Data Engineering, pp. 183\u2013194","DOI":"10.1109\/ICDE.2011.5767884"},{"issue":"1","key":"290_CR32","doi-asserted-by":"publisher","first-page":"2063","DOI":"10.1007\/s10586-018-1811-1","volume":"22","author":"S Lee","year":"2019","unstructured":"Lee S, Kang SH, Kim J, Yu EJ (2019) Scalable distributed data cube computation for large-scale multidimensional data analysis on a Spark cluster. Clust Comput 22(1):2063\u20132087","journal-title":"Clust Comput"},{"issue":"4","key":"290_CR33","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10619-018-7239-z","volume":"37","author":"H Wang","year":"2019","unstructured":"Wang H, Wang Z, Li N, Kong X (2019) Efficient OLAP algorithms on GPU-accelerated Hadoop clusters. Distrib Parallel Databases 37(4):507\u2013542","journal-title":"Distrib Parallel Databases"},{"key":"290_CR34","doi-asserted-by":"crossref","unstructured":"Lin CX, Ding B, Han J, Zhu F, Zhao B (2008) Text cube: Computing IR measures for multidimensional text database analysis. In: 2008 IEEE 8th International Conference on Data Mining, pp. 905\u2013910","DOI":"10.1109\/ICDM.2008.135"},{"key":"290_CR35","doi-asserted-by":"crossref","unstructured":"Qu Q, Zhu F, Yan X, Han J, Philip SY, Li H (2011) Efficient topological OLAP on information networks. In: International Conference on Database Systems for Advanced Applications, pp. 389\u2013403","DOI":"10.1007\/978-3-642-20149-3_29"},{"key":"290_CR36","doi-asserted-by":"crossref","unstructured":"Heine F, Rohde M (2017) PopUp-Cubing: An algorithm to efficiently use iceberg cubes in data streams. In: Proceedings of the Fourth IEEE\/ACM International Conference on Big Data Computing, Applications and Technologies, pp. 11\u201320","DOI":"10.1145\/3148055.3148061"},{"key":"290_CR37","doi-asserted-by":"crossref","unstructured":"Chandra AK, Merlin PM (1977) Optimal implementation of conjunctive queries in relational data bases. In: Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, pp. 77\u201390","DOI":"10.1145\/800105.803397"},{"issue":"2","key":"290_CR38","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1137\/0208017","volume":"8","author":"AV Aho","year":"1979","unstructured":"Aho AV, Sagiv Y, Ullman JD (1979) Equivalences among relational expressions. SIAM J Comput 8(2):218\u2013246","journal-title":"SIAM J Comput"},{"issue":"3","key":"290_CR39","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/211414.211419","volume":"20","author":"YE Ioannidis","year":"1995","unstructured":"Ioannidis YE, Ramakrishnan R (1995) Containment of conjunctive queries: beyond relations as sets. ACM Trans Database Syst 20(3):288\u2013324","journal-title":"ACM Trans Database Syst"},{"key":"290_CR40","doi-asserted-by":"crossref","unstructured":"Cohen S, Nutt W, Sagiv Y (2003) Containment of aggregate queries. In: International Conference on Database Theory, pp. 111\u2013125","DOI":"10.1007\/3-540-36285-1_8"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00290-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-025-00290-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00290-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T08:42:05Z","timestamp":1765528925000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-025-00290-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,10]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["290"],"URL":"https:\/\/doi.org\/10.1007\/s41019-025-00290-1","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"type":"print","value":"2364-1185"},{"type":"electronic","value":"2364-1541"}],"subject":[],"published":{"date-parts":[[2025,6,10]]},"assertion":[{"value":"22 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}