{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T14:50:09Z","timestamp":1781103009744,"version":"3.54.1"},"reference-count":24,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4,1]]},"abstract":"<p>Management of data with a time dimension increases the overhead of storage and query processing in large database applications especially with the join operation, which is a commonly used and expensive relational operator. The temporal join evaluation can be time consuming because temporal data are intrinsically multi-dimensional. Also, due to a limited buffer size, the long-lived data can be frequently swapped-in and swapped-out between disk and main memory thus resulting in a low cache hit ratio. The proposed index-based Hilbert-Temporal Join (Hilbert-TJ) join algorithm maps temporal data into Hilbert curve space that is inherently clustered, thus allowing for fast retrieval and storage. This paper also proposes the Adaptive Replacement Cache-Temporal Data (ARC-TD) buffer replacement policy which favors the cache retention of data pages in proportion to the average life span of the tuples in the buffer. By giving preference to tuples having long life spans, a higher cache hit ratio can be achieved. The caching priority is also balanced between recently and frequently accessed data. The comparison study consists of different join algorithms and buffer replacement policies. Additionally, the Hilbert-TJ algorithm offers support to both valid-time and transaction-time data.<\/p>","DOI":"10.4018\/ijsi.2014040101","type":"journal-article","created":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T14:23:29Z","timestamp":1418048609000},"page":"1-19","source":"Crossref","is-referenced-by-count":1,"title":["Temporal Join with Hilbert Curve Mapping and Adaptive Buffer Management"],"prefix":"10.4018","volume":"2","author":[{"given":"Jaime","family":"Raigoza","sequence":"first","affiliation":[{"name":"California State University, Chico, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junping","family":"Sun","sequence":"additional","affiliation":[{"name":"Graduate School of Computer and Information Sciences, Nova Southeastern University, Fort Lauderdale, FL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijsi.2014040101-0","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223258"},{"key":"ijsi.2014040101-1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007645"},{"key":"ijsi.2014040101-2","first-page":"385","article-title":"Efficiently processing queries on interval-and-value tuples in relational databases.","author":"J.Enderle","year":"2005","journal-title":"Proceedings of the 31st International Conference on Very Large Data Bases"},{"key":"ijsi.2014040101-3","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0111-3"},{"key":"ijsi.2014040101-4","author":"H.Garcia-Molina","year":"2002","journal-title":"Database systems: The complete book"},{"key":"ijsi.2014040101-5","first-page":"439","article-title":"2Q: A low overhead high performance buffer management replacement algorithm.","author":"T.Johnson","year":"1994","journal-title":"Proceedings of the 20th International Conference of Very Large Data Bases"},{"key":"ijsi.2014040101-6","unstructured":"Kline, N., & Soo, M. (1998). Time-IT: The time-integrated testbed. Retrieved July 10, 2012, from ftp:\/\/ftp.cs.arizona.edu\/timecenter\/time-it-0.1.tar.gz"},{"key":"ijsi.2014040101-7","doi-asserted-by":"publisher","DOI":"10.1145\/191246.191298"},{"key":"ijsi.2014040101-8","unstructured":"Lawder, J. K. (2000). The application of space-filling curves to the storage and retrieval of multi-dimensional data. (Unpublished doctoral dissertation). Birkbeck College, University of London, England."},{"key":"ijsi.2014040101-9","author":"J. K.Lawder","year":"2001","journal-title":"Calculation of mappings between one and n-dimensional values using the Hilbert space-filling curve. (Technical Report)"},{"key":"ijsi.2014040101-10","first-page":"20","article-title":"Using space-filling curves for multi-dimensional indexing.","author":"J. K.Lawder","year":"2000","journal-title":"Proceedings of the 17th British National Conference on Databases"},{"key":"ijsi.2014040101-11","doi-asserted-by":"publisher","DOI":"10.1145\/373626.373678"},{"key":"ijsi.2014040101-12","doi-asserted-by":"publisher","DOI":"10.1147\/sj.92.0078"},{"issue":"18","key":"ijsi.2014040101-13","first-page":"7","article-title":"One Up on LRU.;login: -","volume":"4","author":"N.Megiddo","year":"2003","journal-title":"The Magazine of the USENIX Association"},{"key":"ijsi.2014040101-14","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.1297303"},{"key":"ijsi.2014040101-15","author":"G. M.Morton","year":"1966","journal-title":"A computer oriented geodetic data base and a new technique in file sequencing. (Technical Report)"},{"key":"ijsi.2014040101-16","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170081"},{"key":"ijsi.2014040101-17","doi-asserted-by":"publisher","DOI":"10.1145\/2554850.2554903"},{"key":"ijsi.2014040101-18","doi-asserted-by":"publisher","DOI":"10.1145\/7239.7336"},{"key":"ijsi.2014040101-19","author":"A.Silberschatz","year":"2004","journal-title":"Operating system concepts with JAVA"},{"key":"ijsi.2014040101-20","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1007\/3-540-44469-6_46","article-title":"Improving temporal joins using histograms.","author":"I.Sitzmann","year":"2000","journal-title":"Proceedings of the 11th International Conference on Database and Expert Systems Applications"},{"key":"ijsi.2014040101-21","first-page":"252","article-title":"Efficient temporal join processing using time index.","author":"D.Son","year":"1996","journal-title":"Proceedings of the 8th International Conference on Scientific and Statistical Database Management"},{"key":"ijsi.2014040101-22","author":"A. U.Tansel","year":"1993","journal-title":"Temporal databases: theory, design, and implementation"},{"key":"ijsi.2014040101-23","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994701"}],"container-title":["International Journal of Software Innovation"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=119987","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T11:49:17Z","timestamp":1654084157000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijsi.2014040101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2014,4,1]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"URL":"https:\/\/doi.org\/10.4018\/ijsi.2014040101","relation":{},"ISSN":["2166-7160","2166-7179"],"issn-type":[{"value":"2166-7160","type":"print"},{"value":"2166-7179","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,1]]}}}