{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:45Z","timestamp":1725490305448},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442226"},{"type":"electronic","value":"9783540457855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45785-2_23","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T12:10:08Z","timestamp":1188216608000},"page":"289-302","source":"Crossref","is-referenced-by-count":0,"title":["A Linear-Order Based Access Method for Efficient Network Computations"],"prefix":"10.1007","author":[{"given":"Sung-Ho","family":"Woo","sequence":"first","affiliation":[]},{"given":"Sung-Bong","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1080\/02693799008941526","volume":"4","author":"D. J. Abel","year":"1990","unstructured":"Abel, D. J., Mark, D. M.: A comparative analysis of some two-dimensional orderings. Int\u2019l Journal of Geographical Information Systems. 4(1) (1990) 21\u201331","journal-title":"Int\u2019l Journal of Geographical Information Systems"},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/69.277767","volume":"6","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Jagadish, H. V.: Algorithms for searching massive graphs. IEEE Trans. Knowledge and Data Engineering. 6(2) (1994) 225\u2013238","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"23_CR3","unstructured":"Agrawal, R., Kiernan, J.: An access structure for generalized transitive closure queries. Proc. Int\u2019l Conf. Data Engineering. (1993) 429\u2013438"},{"issue":"11","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1684","DOI":"10.1109\/32.9055","volume":"14","author":"J. Banerjee","year":"1988","unstructured":"Banerjee, J., Kim, S., Kim, W., Garza, J.: Clustering a DAG for CAD databases. IEEE Trans. Software Engineering. 14(11) (1988) 1684\u20131699","journal-title":"IEEE Trans. Software Engineering"},{"key":"23_CR5","unstructured":"Brinkhoff, T., Kriegel, H. P.: The impact of global clustering on spatial database systems. Proc. Int\u2019l Conf. Very Large Data Bases. (1994) 168\u2013179"},{"issue":"12","key":"23_CR6","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/43.103500","volume":"10","author":"C. K. Cheng","year":"1991","unstructured":"Cheng, C. K., Wei, Y. A.: An improved two-way partitioning algorithm with stable performance. IEEE Trans. Computer-Aided Design. 10(12) (1991) 1502\u20131511","journal-title":"IEEE Trans. Computer-Aided Design"},{"issue":"2","key":"23_CR7","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede V., Gunther, O.: Multidimensional access methods. ACM Computing Surveys. 30(2) (1998) 170\u2013231","journal-title":"ACM Computing Surveys"},{"key":"23_CR8","unstructured":"Garey, M. R., Johnson, D. S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman and Company (1979)"},{"key":"23_CR9","unstructured":"Hendrickson, B., Leland, R.: The Chaco user\u2019s guide version 2.0. Tech. Rep. SAND95-2344, Sandia National Laboratories (1995)"},{"key":"23_CR10","unstructured":"Hua, K. A., Su, J. X. W., Hua, C. M.: Efficient evaluation of traversal recursive queries using connectivity index. Proc. Int\u2019l Conf. Data Engineering. (1993) 549\u2013558"},{"key":"23_CR11","unstructured":"Jing, B.: I\/O-efficiency of shortest path algorithms: An analysis. Proc. Int\u2019l Conf. Data Engineering. (1992) 12\u201319"},{"issue":"3","key":"23_CR12","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/69.687976","volume":"10","author":"N. Jing","year":"1998","unstructured":"Jing, N., Huang, Y. W., Rundensteiner, E. A.: Hierarchical encoded path views for path query processing: An optimal model and Its performance evaluation. IEEE Trans. Knowledge and Data Engineering. 10(3) (1998) 409\u2013432","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1145\/155271.155273","volume":"18","author":"Y. Ioannidis","year":"1993","unstructured":"Ioannidis, Y., Ramakrishnan, R., Winger, L.: Transitive closure algorithms based on graph traversal. ACM Trans. Database Systems. 18(3) (1993) 512\u2013576","journal-title":"ACM Trans. Database Systems"},{"key":"23_CR14","unstructured":"Larson, P. A., Deshpande, V.: A file structure supporting traversal recursion. Proc. Int\u2019l Conf. Management of Data. (1989) 243\u2013252"},{"issue":"1","key":"23_CR15","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/69.908985","volume":"13","author":"B. Moon","year":"2001","unstructured":"Moon, B., Jagadish, H. V., Faloutsos, C., Salts, J. H.: Analysis of the clustering properties of the Hilbert space-filling curve. IEEE Trans. Knowledge and Data Engineering. 13(1) (2001) 124\u2013141","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Samet, H.: The design and analysis of spatial data structures. Addison-Wesley (1990)","DOI":"10.1007\/3-540-52208-5_28"},{"key":"23_CR17","unstructured":"Shekhar, S., Kohli, A., Coyle, M.: Path computation algorithms for advanced traveler information systems. Proc. Int\u2019l Conf. Data Engineering. (1993) 31\u201339"},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/69.567054","volume":"9","author":"S. Shekhar","year":"1997","unstructured":"Shekhar, S., Liu, D. R.: CCAM: A connectivity-clustered access method for networks and network computations. IEEE Trans. Knowledge and Data Engineering. 9(1) (1997) 102\u2013119","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"issue":"3","key":"23_CR19","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1109\/69.506711","volume":"8","author":"J. Teuhola","year":"1996","unstructured":"Teuhola, J.: Path signatures: A way to speed up recursion in relational databases. IEEE Trans. Knowledge and Data Engineering. 8(3) (1996) 446\u2013454","journal-title":"IEEE Trans. Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Engineering and Deployment of Cooperative Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45785-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T12:37:56Z","timestamp":1556800676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45785-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442226","9783540457855"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45785-2_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}