{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:47:33Z","timestamp":1763466453741,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,8,22]],"date-time":"2004-08-22T00:00:00Z","timestamp":1093132800000},"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":[],"published-print":{"date-parts":[[2004,8,22]]},"DOI":"10.1145\/1014052.1014080","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"236-245","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":200,"title":["Mining, indexing, and querying historical spatiotemporal data"],"prefix":"10.1145","author":[{"given":"Nikos","family":"Mamoulis","sequence":"first","affiliation":[{"name":"University of Hong Kong"}]},{"given":"Huiping","family":"Cao","sequence":"additional","affiliation":[{"name":"University of Hong Kong"}]},{"given":"George","family":"Kollios","sequence":"additional","affiliation":[{"name":"Boston Universtiy"}]},{"given":"Marios","family":"Hadjieleftheriou","sequence":"additional","affiliation":[{"name":"University of California, Riverside"}]},{"given":"Yufei","family":"Tao","sequence":"additional","affiliation":[{"name":"City University of Hong Kong"}]},{"given":"David W.","family":"Cheung","sequence":"additional","affiliation":[{"name":"University of Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2004,8,22]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"487","volume-title":"Proc. of Very Large Data Bases","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules . In Proc. of Very Large Data Bases , pages 487 -- 499 , 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of Very Large Data Bases, pages 487--499, 1994."},{"key":"e_1_3_2_1_2_1","first-page":"226","volume-title":"Proc. of ACM Knowledge Discovery and Data Mining","author":"Ester M.","year":"1996","unstructured":"M. Ester , H. P. Kriegel , J. Sander , and X. Xu . A density-based algorithm for discovering clusters in large spatial databases with noise . In Proc. of ACM Knowledge Discovery and Data Mining , pages 226 -- 231 , 1996 . M. Ester, H. P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proc. of ACM Knowledge Discovery and Data Mining, pages 226--231, 1996."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645340.650233"},{"key":"e_1_3_2_1_5_1","first-page":"106","volume-title":"Proc. of International Conference on Data Engineering","author":"Han J.","year":"1999","unstructured":"J. Han , G. Dong , and Y. Yin . Efficient mining of partial periodic patterns in time series database . In Proc. of International Conference on Data Engineering , pages 106 -- 115 , 1999 . J. Han, G. Dong, and Y. Yin. Efficient mining of partial periodic patterns in time series database. In Proc. of International Conference on Data Engineering, pages 106--115, 1999."},{"key":"e_1_3_2_1_6_1","first-page":"363","volume-title":"Proc. of Very Large Data Bases","author":"Indyk P.","year":"2000","unstructured":"P. Indyk , N. Koudas , and S. Muthukrishnan . Identifying representative trends in massive time series data sets using sketches . In Proc. of Very Large Data Bases , pages 363 -- 372 , 2000 . P. Indyk, N. Koudas, and S. Muthukrishnan. Identifying representative trends in massive time series data sets using sketches. In Proc. of Very Large Data Bases, pages 363--372, 2000."},{"key":"e_1_3_2_1_7_1","first-page":"205","volume-title":"Proc. of International Conference on Data Engineering","author":"Ma S.","year":"2001","unstructured":"S. Ma and J. L. Hellerstein . Mining partially periodic event patterns with unknown periods . In Proc. of International Conference on Data Engineering , pages 205 -- 214 , 2001 . S. Ma and J. L. Hellerstein. Mining partially periodic event patterns with unknown periods. In Proc. of International Conference on Data Engineering, pages 205--214, 2001."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/645483.656222"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1161583"},{"key":"e_1_3_2_1_10_1","first-page":"395","volume-title":"The VLDB Journal","author":"Pfoser D.","year":"2000","unstructured":"D. Pfoser , C. S. Jensen , and Y. Theodoridis . Novel approaches in query processing for moving object trajectories . In The VLDB Journal , pages 395 -- 406 , 2000 . D. Pfoser, C. S. Jensen, and Y. Theodoridis. Novel approaches in query processing for moving object trajectories. In The VLDB Journal, pages 395--406, 2000."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/319806.319816"},{"key":"e_1_3_2_1_12_1","first-page":"449","volume-title":"Proc. of International Conference on Data Engineering","author":"Tao Y.","year":"2004","unstructured":"Y. Tao , G. Kollios , J. Considine , F. Li , and D. Papadias . Spatio-temporal aggregation using sketches . In Proc. of International Conference on Data Engineering , pages 449 -- 460 , 2004 . Y. Tao, G. Kollios, J. Considine, F. Li, and D. Papadias. Spatio-temporal aggregation using sketches. In Proc. of International Conference on Data Engineering, pages 449--460, 2004."},{"key":"e_1_3_2_1_13_1","first-page":"431","volume-title":"Proc. of Very Large Data Bases","author":"Tao Y.","year":"2001","unstructured":"Y. Tao and D. Papadias . MV3R--tree: A spatio-temporal access method for timestamp and interval queries . In Proc. of Very Large Data Bases , pages 431 -- 440 , 2001 . Y. Tao and D. Papadias. MV3R--tree: A spatio-temporal access method for timestamp and interval queries. In Proc. of Very Large Data Bases, pages 431--440, 2001."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/647227.719225"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347150"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007652502315"}],"event":{"name":"KDD04: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"],"location":"Seattle WA USA","acronym":"KDD04"},"container-title":["Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014080","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1014052.1014080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:30Z","timestamp":1750264290000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,22]]},"references-count":16,"alternative-id":["10.1145\/1014052.1014080","10.1145\/1014052"],"URL":"https:\/\/doi.org\/10.1145\/1014052.1014080","relation":{},"subject":[],"published":{"date-parts":[[2004,8,22]]},"assertion":[{"value":"2004-08-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}