{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:22:09Z","timestamp":1742397729176,"version":"3.38.0"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1109\/tkde.2002.1019221","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T21:39:07Z","timestamp":1034977147000},"page":"902-919","source":"Crossref","is-referenced-by-count":9,"title":["Hashing methods for temporal data"],"prefix":"10.1109","volume":"14","author":[{"given":"G.","family":"Kollios","sequence":"first","affiliation":[]},{"given":"V.J.","family":"Tsotras","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1145\/16856.16864"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1007\/s007780050028"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/93605.98741"},{"key":"ref4","first-page":"168","article-title":"Query Processing Techniques for Multiversion Access Methods","volume-title":"Proc. Very Large Databases Conf.","author":"Van den Bercken"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1145\/356770.356776"},{"volume-title":"Introduction to Algorithms","year":"1990","author":"Cormen","key":"ref6"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/SFCS.1988.21968"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1016\/0022-0000(89)90034-2"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1145\/46157.330532"},{"volume-title":"Fundamentals of Database Systems","year":"2000","author":"Elmasri","key":"ref10"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/320083.320092"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1145\/146585.146591"},{"volume-title":"File Structures","year":"1998","author":"Folk","key":"ref13"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1145\/971697.602266"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1145\/181550.181560"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/69.755613"},{"author":"Kollios","doi-asserted-by":"crossref","article-title":"Hashing Methods for Temporal Data","key":"ref17","DOI":"10.1109\/TKDE.2002.1019221"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/69.667079"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1007\/BF01931695"},{"key":"ref20","first-page":"212","article-title":"Linear Hashing: A New Tool for File and Table Addressing","volume-title":"Proc. Very Large Databases Conf.","author":"Litwin"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1145\/236711.236713"},{"key":"ref22","first-page":"383","article-title":"Temporal Query Processing and Optimization in Multiprocessor Database Machines","volume-title":"Proc. Very Large Databases Conf.","author":"Leung"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1145\/235968.233337"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1145\/66926.66956"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1007\/BF01354880"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/69.404027"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/SSDM.1999.787639"},{"volume-title":"Database Management Systems","year":"1997","author":"Ramakrishnan","key":"ref28"},{"volume-title":"File Structures","year":"1988","author":"Salzberg","key":"ref29"},{"key":"ref31","first-page":"469","article-title":"Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines","volume-title":"Proc. Very Large Databases Conf.","author":"Schneider"},{"year":"1995","author":"Salzberg","article-title":"Branched and Temporal Index Structures","key":"ref32"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/ICDE.1994.283042"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1145\/319806.319816"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1109\/69.404032"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1145\/273244.273258"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1016\/0306-4379(95)00011-R"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1002\/047134608X.W4306"},{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1109\/69.599929"},{"year":"1997","author":"Zurek","article-title":"Optimization of Partitioned Temporal Joins","key":"ref40"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/69\/21919\/01019221.pdf?arnumber=1019221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T05:12:09Z","timestamp":1742015529000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1019221\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,7]]}},"URL":"https:\/\/doi.org\/10.1109\/tkde.2002.1019221","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}