{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:10:02Z","timestamp":1750255802699,"version":"3.41.0"},"reference-count":50,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[1992,12]]},"abstract":"<jats:p>In this paper a new method to improve the utilization of main memory systems is presented. The new method is based on prestoring in main memory a number of query answers, each evaluated out of a single memory page. To this end, the ideas of page-answers and page-traces are formally described and their properties analyzed. The query model used here allows for selection, projection, join, recursive queries as well as arbitrary combinations. We also show how to apply the approach under update traffic. This concept is especially useful in managing the main memories of an important class of applications. This class includes the evaluation of triggers and alerters, performance improvement of rule-based systems, integrity constraint checking, and materialized views. These applications are  characterized by the existence at compile time of a predetermined set of queries, by a slow but persistent update traffic, and by their need to repetitively reevaluate the query set. The new approach represents a new type of intelligent database caching, which contrasts with traditional caching primarily in that the cache elements are derived data and as a consequence, they overlap arbitrarily and do not have a fixed length. The contents of the main memory cache are selected based on the data distribution within the database, the set of fixed queries to preprocess, and the paging characteristics. Page-answers and page-traces are used as the smallest indivisible units in the cache. An efficient heuristic to select a near optimal set of page-answers and page-traces to populate the main  memory has been developed, implemented, and tested. Finally, quantitative measurements of performance benefits are reported.<\/jats:p>","DOI":"10.1145\/146931.146933","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:29:00Z","timestamp":1027769340000},"page":"601-646","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Intelligent database caching through the use of page-answers and page-traces"],"prefix":"10.1145","volume":"17","author":[{"given":"Nabil","family":"Kamel","sequence":"first","affiliation":[]},{"given":"Roger","family":"King","sequence":"additional","affiliation":[]}],"member":"320","published-online":{"date-parts":[[1992,12]]},"reference":[{"key":"e_1_2_1_1_2","first-page":"457","volume-title":"Proceedings of the 12th VLDB (Kyoto","author":"BLAKELEY J. A.","year":"1986"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_2","DOI":"10.1145\/16894.16861"},{"key":"e_1_2_1_3_2","first-page":"13","volume-title":"R., AND KAMEL","author":"BEIN","year":"1987"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_2","DOI":"10.1016\/S0022-0000(73)80033-9"},{"issue":"3","key":"e_1_2_1_5_2","first-page":"38","article-title":"Processing multiple querms m database systems","volume":"5","author":"CHAKRAVARTHY U. S.","year":"1982","journal-title":"IEEE Quart. Bull. Database Eng."},{"key":"e_1_2_1_6_2","first-page":"384","volume-title":"Proceedings of the 12th VLDB (Kyoto","author":"CHAKRAVARTHY U. S.","year":"1986"},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_2","DOI":"10.1145\/582192.582204"},{"doi-asserted-by":"publisher","key":"e_1_2_1_8_2","DOI":"10.1016\/0306-4379(84)90017-6"},{"doi-asserted-by":"publisher","key":"e_1_2_1_9_2","DOI":"10.1145\/329.318578"},{"doi-asserted-by":"publisher","key":"e_1_2_1_10_2","DOI":"10.1145\/67544.66947"},{"doi-asserted-by":"publisher","key":"e_1_2_1_11_2","DOI":"10.1145\/602259.602261"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_2","DOI":"10.1145\/1994.1995"},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_2","DOI":"10.1145\/582353.582400"},{"doi-asserted-by":"publisher","key":"e_1_2_1_14_2","DOI":"10.1016\/0004-3702(82)90020-0"},{"key":"e_1_2_1_15_2","first-page":"1","volume-title":"Procee&amp;ngs of the 3rd VLDB (Brussels","author":"HAMMER M.","year":"1976"},{"doi-asserted-by":"publisher","key":"e_1_2_1_16_2","DOI":"10.1109\/TSE.1983.236458"},{"doi-asserted-by":"publisher","key":"e_1_2_1_17_2","DOI":"10.1145\/356924.356928"},{"doi-asserted-by":"publisher","key":"e_1_2_1_18_2","DOI":"10.1007\/978-3-642-82375-6_11"},{"volume-title":"Proceedings of the 3rd IEEE Conference on Art,ficzal Intelhgence Apphcatzons (Orlando, Fla.","year":"1987","author":"KAMEL N.","key":"e_1_2_1_19_2"},{"key":"e_1_2_1_21_2","first-page":"188","volume-title":"Proceedings of the Supercomputing Conference (Santa Clara, Calif.","author":"KAMEL N.","year":"1987"},{"volume-title":"Proceedings of the Internatzonal Conference on Data and Knowledge Systems for Engineering and Manufacturing (Hartford, Conn.","year":"1988","author":"KAMEL N.","key":"e_1_2_1_22_2"},{"doi-asserted-by":"publisher","key":"e_1_2_1_23_2","DOI":"10.1145\/319830.319836"},{"key":"e_1_2_1_24_2","first-page":"1","article-title":"Polynomial complete consecutive information retrieval problems","volume":"6","year":"1977","journal-title":"SIAM J. Comput."},{"key":"e_1_2_1_25_2","first-page":"259","volume-title":"Proceedings of the llth VLDB","author":"LARSON P.-A.","year":"1980"},{"key":"e_1_2_1_26_2","first-page":"294","volume-title":"Procee&amp;ngs of the 12th VLDB (Kyoto","author":"LEHMAN T. J.","year":"1986"},{"doi-asserted-by":"publisher","key":"e_1_2_1_27_2","DOI":"10.1145\/320434.320449"},{"key":"e_1_2_1_28_2","first-page":"320","author":"MENDENHALL W.","year":"1981","journal-title":"Mass."},{"key":"e_1_2_1_29_2","first-page":"3","article-title":"Logic for improving integrity checking in relational data bases","volume":"18","author":"NICOLAS J.-M","year":"1982","journal-title":"Acts Inf."},{"doi-asserted-by":"publisher","key":"e_1_2_1_30_2","DOI":"10.1145\/382272.382273"},{"key":"e_1_2_1_31_2","first-page":"3","volume-title":"Proceedings of the 12th VLDB (Kyoto","author":"QIAN X.","year":"1986"},{"key":"e_1_2_1_32_2","first-page":"64","volume-title":"Proceedings of the 6th VLDB (Montreal","author":"ROSENKRANTZ D.","year":"1980"},{"doi-asserted-by":"publisher","key":"e_1_2_1_33_2","DOI":"10.1145\/319702.319729"},{"doi-asserted-by":"publisher","key":"e_1_2_1_34_2","DOI":"10.1145\/27632.27649"},{"doi-asserted-by":"publisher","key":"e_1_2_1_35_2","DOI":"10.1145\/7239.7336"},{"key":"e_1_2_1_36_2","first-page":"257","volume-title":"Proceedings of the 8th VLDB (Mexico City","author":"SACCO G.","year":"1982"},{"unstructured":"SEDGEW~CK R. Algorzthms. 2nd ed. Addison Wesley Reading Mass 1988.]]   SEDGEW~CK R. Algorzthms. 2nd ed. Addison Wesley Reading Mass 1988.]]","key":"e_1_2_1_37_2"},{"doi-asserted-by":"publisher","key":"e_1_2_1_38_2","DOI":"10.1145\/16894.16874"},{"doi-asserted-by":"publisher","key":"e_1_2_1_39_2","DOI":"10.1145\/42201.42203"},{"doi-asserted-by":"publisher","key":"e_1_2_1_40_2","DOI":"10.1145\/50202.50251"},{"doi-asserted-by":"publisher","key":"e_1_2_1_41_2","DOI":"10.1145\/320473.320484"},{"volume-title":"Bellcore","year":"1989","author":"SHETH A. P.","key":"e_1_2_1_43_2"},{"doi-asserted-by":"publisher","key":"e_1_2_1_44_2","DOI":"10.1145\/320473.320487"},{"doi-asserted-by":"publisher","key":"e_1_2_1_45_2","DOI":"10.1145\/320473.320476"},{"doi-asserted-by":"publisher","key":"e_1_2_1_46_2","DOI":"10.1145\/67544.66943"},{"volume-title":"Principles of Database Systems","year":"1982","author":"ULLMAN J. D.","key":"e_1_2_1_47_2"},{"volume-title":"Principles of Database and Knowledge-Base Systems","year":"1988","author":"ULLMAN J. D.","key":"e_1_2_1_48_2"},{"volume-title":"Database Design","year":"1977","author":"WIEDER OLD","key":"e_1_2_1_49_2"},{"doi-asserted-by":"publisher","key":"e_1_2_1_50_2","DOI":"10.1145\/320473.320479"},{"doi-asserted-by":"publisher","key":"e_1_2_1_51_2","DOI":"10.1145\/359461.359475"},{"volume-title":"Oct. 1979)","author":"YOUSSEFI K.","first-page":"409","key":"e_1_2_1_52_2"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/146931.146933","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/146931.146933","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:42Z","timestamp":1750253382000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/146931.146933"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":50,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["10.1145\/146931.146933"],"URL":"https:\/\/doi.org\/10.1145\/146931.146933","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"type":"print","value":"0362-5915"},{"type":"electronic","value":"1557-4644"}],"subject":[],"published":{"date-parts":[[1992,12]]},"assertion":[{"value":"1992-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}