{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:23:10Z","timestamp":1775283790222,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1109\/icde.2010.5447885","type":"proceedings-article","created":{"date-parts":[[2010,12,8]],"date-time":"2010-12-08T17:25:00Z","timestamp":1291829100000},"page":"177-188","source":"Crossref","is-referenced-by-count":8,"title":["PARINET: A tunable access method for in-network trajectories"],"prefix":"10.1109","author":[{"given":"Iulian","family":"Sandu Popa","sequence":"first","affiliation":[]},{"given":"Karine","family":"Zeitouni","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Oria","sequence":"additional","affiliation":[]},{"given":"Dominique","family":"Barth","sequence":"additional","affiliation":[]},{"given":"Sandrine","family":"Vial","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"ref11","article-title":"Managing Intervals Efficiently in Object-Relational Databases","author":"kriegel","year":"2000","journal-title":"Proc Int Conf on Very Large Databases (VLDB)"},{"key":"ref12","year":"0","journal-title":"Metis - family of multilevel partitioning algorithms"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007639"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1132863.1132870"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/956676.956680"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-007-0032-1"},{"key":"ref17","first-page":"431","article-title":"MV3R-Tree: A spatio-temporal access method for timestamp and interval queries","author":"tao","year":"2001","journal-title":"Proceedings of the International Conference on Very Large Data Bases"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50075-6"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376622"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1023\/A:1015231126594","article-title":"A framework for generating network-based moving objects","volume":"6","author":"brinkhoff","year":"2002","journal-title":"GeoInformatica"},{"key":"ref6","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref5","first-page":"289","article-title":"Indexing objects moving on fixed networks","author":"frentzos","year":"2003","journal-title":"Proc SSTD"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0151-3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0152-x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-007-0030-3"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-004-5621-7"},{"key":"ref9","article-title":"The INFATI Data","author":"jensen","year":"2008"}],"event":{"name":"2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)","location":"Long Beach, CA, USA","start":{"date-parts":[[2010,3,1]]},"end":{"date-parts":[[2010,3,6]]}},"container-title":["2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5443872\/5447611\/05447885.pdf?arnumber=5447885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T17:00:27Z","timestamp":1497891627000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5447885\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icde.2010.5447885","relation":{},"subject":[],"published":{"date-parts":[[2010]]}}}