{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:34Z","timestamp":1725552154986},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540308485"},{"type":"electronic","value":"9783540324232"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11599289_3","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T09:53:05Z","timestamp":1132739585000},"page":"19-30","source":"Crossref","is-referenced-by-count":5,"title":["Towards a Taxonomy of Location Based Services"],"prefix":"10.1007","author":[{"given":"Kostas","family":"Gratsias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elias","family":"Frentzos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasilis","family":"Delis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Theodoridis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Benetis, R., Jensen, C., Karciauskas, G., Saltenis, S.: Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects. In: Proceedings of IDEAS Symposium (2002)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"8","key":"3_CR3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/2.940011","volume":"34","author":"N. Davies","year":"2001","unstructured":"Davies, N., et al.: Using and Determining Location in a Context-Sensitive Tour Guide. IEEE Computer\u00a034(8), 35\u201341 (2001)","journal-title":"IEEE Computer"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: a dynamic index structure for spatial searching. In: Proceedings of ACM SIGMOD Conference (1984)","DOI":"10.1145\/602259.602266"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G. Hjaltason","year":"1999","unstructured":"Hjaltason, G., Samet, H.: Distance Browsing in Spatial Databases. ACM Transactions in Database Systems\u00a024(2), 265\u2013318 (1999)","journal-title":"ACM Transactions in Database Systems"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"D.B. Johnson","year":"1977","unstructured":"Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. Journal of the ACM\u00a024(1), 1\u201313 (1977)","journal-title":"Journal of the ACM"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Jensen, C., Kolar, J., Pedersen, T., Timko, I.: Nearest Neighbor Queries in Road Networks. In: Proceedings of ACM-GIS Symposium (2003)","DOI":"10.1145\/956676.956677"},{"key":"3_CR8","unstructured":"Jensen, C., Christensen, A., Pedersen, T., Pfoser, D., Saltenis, S., Tryfona, N.: Location-Based Services: A Database Perspective. In: Proceedings of Scandinavian GIS (2001)"},{"key":"3_CR9","unstructured":"Lopez, X.: The Future of GIS: Real-time, Mission Critical, Location Services. In: Proceedings of Cambridge Conference (2003)"},{"key":"3_CR10","unstructured":"Open GIS Consortium, OpenGIS\u00ae Location Services (OpenLS): Core Services, Available at \n                    \n                      http:\/\/www.opengis.org"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases. In: Proceedings of VLDB Conference (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"3_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry, An Introduction","author":"F. Preparata","year":"1985","unstructured":"Preparata, F., Shamos, M.: Computational Geometry, An Introduction. Springer, New York (1985)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: Proceedings of ACM SIGMOD Conference (1995)","DOI":"10.1145\/223784.223794"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Saltenis, S., Jensen, C.S., Leutenegger, S., Lopez, M.: Indexing the Positions of Continuously Moving Objects. In: Proceedings of ACM SIGMOD Conference (2000)","DOI":"10.1145\/342009.335427"},{"key":"3_CR15","unstructured":"Swedberg, G.: Ericsson\u2019s Mobile Location Solution. Ericsson Review\u00a04 (1999)"},{"issue":"6","key":"3_CR16","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1093\/comjnl\/46.6.713","volume":"46","author":"Y. Theodoridis","year":"2003","unstructured":"Theodoridis, Y.: Ten Benchmark Queries for Location Based Services. The Computer Journal\u00a046(6), 713\u2013725 (2003)","journal-title":"The Computer Journal"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1093\/comjnl\/41.3.185","volume":"41","author":"J. Tayeb","year":"1998","unstructured":"Tayeb, J., Ulusoy, O., Wolfson, O.: A Quadtree-Based Dynamic Attribute Indexing Method. The Computer Journal\u00a041(3), 185\u2013200 (1998)","journal-title":"The Computer Journal"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Shen, Q.: Continuous Nearest Neighbor Search. In: Proceedings of VLDB Conference (2002)","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Sun, J.: The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries. In: Proceedings of VLDB Conference (2003)","DOI":"10.1016\/B978-012722442-8\/50075-6"}],"container-title":["Lecture Notes in Computer Science","Web and Wireless Geographical Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11599289_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:11:06Z","timestamp":1558289466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11599289_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540308485","9783540324232"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11599289_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}