{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:38:44Z","timestamp":1648931924055},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,12,27]],"date-time":"2013-12-27T00:00:00Z","timestamp":1388102400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10844-013-0289-9","type":"journal-article","created":{"date-parts":[[2013,12,26]],"date-time":"2013-12-26T06:26:40Z","timestamp":1388039200000},"page":"567-594","source":"Crossref","is-referenced-by-count":0,"title":["Token list based information search in a multi-dimensional massive database"],"prefix":"10.1007","volume":"42","author":[{"given":"Haiying","family":"Shen","sequence":"first","affiliation":[]},{"given":"Ze","family":"Li","sequence":"additional","affiliation":[]},{"given":"Ting","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,27]]},"reference":[{"key":"289_CR1","doi-asserted-by":"crossref","unstructured":"Aberer, K., Cudr\u00e8-Mauroux, P., Hauswirth, M. (2003). The chatty web: emergent semantics through gossiping. In Proceedings of the 12nd international world wide web conference.","DOI":"10.1145\/775152.775180"},{"issue":"4","key":"289_CR2","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1108\/14684520310489023","volume":"27","author":"D Alimohammadi","year":"2003","unstructured":"Alimohammadi, D. (2003). Meta-tag: a means to control the process of web indexing. Online Information Review, 27(4), 238\u2013242.","journal-title":"Online Information Review"},{"key":"289_CR3","unstructured":"Andoni, A. (2005). Lsh algorithm and implementation (e2lsh). http:\/\/web.mit.edu\/andoni\/www\/LSH\/index.html."},{"key":"289_CR4","unstructured":"Andoni, A., & Indyk, P. (2005). E2lsh 0.1 user manual. http:\/\/web.mit.edu\/andoni\/www\/LSH\/index.html ."},{"key":"289_CR5","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A. (1994). An optimal algorithm for approximate nearest neighbor searching. In Proceedings 5th ACM-SIAM symposium discrete algorithms."},{"key":"289_CR6","doi-asserted-by":"crossref","unstructured":"Bayer, R., & McCreight, E. (1970). Organization and maintenance of large ordered indices. In Proceedings of ACM-SIGFIDET workshop on data description and access (pp. 107\u2013141).","DOI":"10.21236\/AD0712079"},{"key":"289_CR7","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H., Schneider, R., Seeger, B. (1990). The r*-tree: an efficient and robust access method for points and rectangles. In Proceedings of the ACM SIGMOD international conference on management of data (pp. 322\u2013331).","DOI":"10.1145\/93605.98741"},{"key":"289_CR8","doi-asserted-by":"crossref","unstructured":"Bennett, K.P., Fayyad, U., Geiger, D. (1999). Density-based indexing for approximate nearest-neighbor queries. In Proceedings of KDD.","DOI":"10.1145\/312129.312236"},{"issue":"3","key":"289_CR9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"JL Bentle","year":"1977","unstructured":"Bentle, J.L., Friedman, J.H., Finkel, R.A. (1977). An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software, 3(3), 209\u2013226.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"289_CR10","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-P. (1996). The x-tree: an index structure for high-dimensional data. In Proceedings of the 22nd international conference on very large databases (pp. 28\u201339)."},{"key":"289_CR11","doi-asserted-by":"crossref","unstructured":"Berrani, S.A., Amsaleg, L., Grosr, P. (2003). Approximate searches: k-neighbors + precision. In Proceedings of CIKM.","DOI":"10.1145\/956863.956870"},{"issue":"2","key":"289_CR12","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1137\/S0036144598347035","volume":"41","author":"MW Berry","year":"1999","unstructured":"Berry, M.W., Drmac, Z., Jessup, E.R. (1999). Matrices vector spaces, and information retrieval. SIAM Review, 41(2), 335\u2013362.","journal-title":"SIAM Review"},{"key":"289_CR13","unstructured":"Blachman, N. (2007). Google guide, making searching even easier. http:\/\/www.googleguide.com\/google_works.html ."},{"issue":"3","key":"289_CR14","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C Bohm","year":"2001","unstructured":"Bohm, C., Berchtold, S., Keim, D.A. (2001). Searching in high-dimensional spaces: index structures for improving the performance of multimedia databases. ACM Computing Surveys, 33(3), 322\u2013373.","journal-title":"ACM Computing Surveys"},{"key":"289_CR15","unstructured":"Brin, S. (1995). Near neighbor search in large metric space. In Proceedings of the 21st international conference on VLDB."},{"key":"289_CR16","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Church, K., Konig, A., Sui, L. (2007). Heavy-tailed distributions and multi-keyword queries. In Proceedings of SIGIR.","DOI":"10.1145\/1277741.1277855"},{"key":"289_CR17","doi-asserted-by":"crossref","unstructured":"Chen, H., Jin, H., Wang, J., Chen, L., Liu, Y., Ni, L. (2008). Efficient multi-keyword search over p2p web. In Proceedings of WWW (pp. 989\u2013998).","DOI":"10.1145\/1367497.1367631"},{"issue":"7","key":"289_CR18","first-page":"969","volume":"59","author":"H Chen","year":"2010","unstructured":"Chen, H., Yan, J., Jin, H., Liu, Y., Ni, L. (2010). TSS: efficient term set search in large peer-to-peer textual collections. TC, 59(7), 969\u2013980.","journal-title":"TC"},{"issue":"2","key":"289_CR19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer, D. (1979). The ubiquitous B-tree. Computing Surveys, 11(2), 121\u2013138.","journal-title":"Computing Surveys"},{"issue":"1","key":"289_CR20","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"IT-13","author":"T Cover","year":"1967","unstructured":"Cover, T., & Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions of Information Theory, IT-13(1), 21\u201327.","journal-title":"IEEE Transactions of Information Theory"},{"key":"289_CR21","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S. (2003). Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of DIMACS workshop on streaming data analysis and mining."},{"key":"289_CR22","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S. (2004). Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of the 20th annual symposium on computational geometry (SCG).","DOI":"10.1145\/997817.997857"},{"issue":"6","key":"289_CR23","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9","volume":"41","author":"S Deerwester","year":"1990","unstructured":"Deerwester, S., Dumais, S.T., Landauer, T.K., Fumas, G.W., Harshman, R.A. (1990). Indexing by latent semantic analysis. Journal of the Society for Information Science, 41(6), 391\u2013407.","journal-title":"Journal of the Society for Information Science"},{"key":"289_CR24","doi-asserted-by":"crossref","unstructured":"Fagin, R. (1998). Fuzzy queries in multimedia database systems. In Proceedings ACM symposium on principles of database systems.","DOI":"10.1145\/275487.275488"},{"key":"289_CR25","doi-asserted-by":"crossref","unstructured":"Filho, R.F.S., Traina, A.J.M., Traina, J.C., Faloutsos, C. (2001). Similarity search without tears: the omni family of all-purpose access methods. In Proceedings of ICDE.","DOI":"10.1109\/ICDE.2001.914877"},{"issue":"2","key":"289_CR26","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/PL00010672","volume":"9","author":"A Fu","year":"2000","unstructured":"Fu, A., Chan, P.M.S., Cheung, Y.L., Moon, Y.S. (2000). Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances. VLDB Journal, 9(2), 154\u2013173.","journal-title":"VLDB Journal"},{"key":"289_CR27","unstructured":"Gionis, A., Indyk, P., Motwani, R. (1999). Similarity search in high dimensions via hashing. In Proceedings of international conference on very large data bases (VLDB) (pp. 518\u2013529)."},{"key":"289_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4020-3005-5","volume-title":"iFlow: information retrieval","author":"DA Grossman","year":"2004","unstructured":"Grossman, D.A., & Frieder, O. (2004). iFlow: information retrieval. The Netherlands: Springer."},{"key":"289_CR29","doi-asserted-by":"crossref","unstructured":"Guttman, A. (1984). R-trees: a dynamic index structure for spatial searching. In Proceedings of the SIGMOD conference (pp. 47\u201357).","DOI":"10.1145\/971697.602266"},{"key":"289_CR30","doi-asserted-by":"crossref","unstructured":"Halevy, A.Y., Ives, Z.G., Mork, P., Tatarinov, I. (2003). Piazza: data management infrastructure for semantic web applications. In Proceedings of the 12nd international world wide web conference.","DOI":"10.1145\/775152.775231"},{"key":"289_CR31","doi-asserted-by":"crossref","unstructured":"Hu, J.J., Tang, C.J., Peng, J., Li, C., Yuan, C.A., Chen, A.L. (2005). A clustering algorithm based absorbing nearest neighbors. In 6th International conference of WAIM.","DOI":"10.1007\/11563952_67"},{"key":"289_CR32","doi-asserted-by":"crossref","unstructured":"Indyk, P., & Motwani, R. (1998). Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of the 30th annual ACM symposium on theory of computing.","DOI":"10.1145\/276698.276876"},{"key":"289_CR33","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M. (1997). Two algorithms for nearest-neighbor search in high dimensions. In Proceedings of ACM symposium on theory of computing (STOC).","DOI":"10.1145\/258533.258653"},{"key":"289_CR34","doi-asserted-by":"crossref","unstructured":"Kruskal, J.B., & Wish, M. (1978). Multidimensional scaling. Beverly Hills: SAGE publication.","DOI":"10.4135\/9781412985130"},{"key":"289_CR35","first-page":"738","volume":"2006","author":"S Kulkami","year":"2006","unstructured":"Kulkami, S., & Orlandic, R. (2006). High-dimensional similarity search using data sensitive space partitioning. Lecture Notes in Computer Science (LNCS), 4080(2006), 738\u2013750.","journal-title":"Lecture Notes in Computer Science (LNCS)"},{"key":"289_CR36","doi-asserted-by":"crossref","unstructured":"Lam, H., Perego, R., Quan, N., Silvestri, F. (2009). Entry pairing in inverted file. In Proceedings of WISE (Vol. 5802, pp. 511\u2013522).","DOI":"10.1007\/978-3-642-04409-0_50"},{"key":"289_CR37","doi-asserted-by":"crossref","unstructured":"Li, C., Chang, E., Garcia-Molina, H.,Wiederhold, G. (2002). Clustering for approximate similarity search in high-dimensional spaces. IEEE Transactions of Knowledge and Data Engineering, 14(4), 792\u2013808.","DOI":"10.1109\/TKDE.2002.1019214"},{"key":"289_CR38","unstructured":"Li, T., Shen, H., Rosequist, A. (2008). Token list based data searching in a multi-dimensional massive database. In Proceedings of The 4th international conference on data mining (DMIN)."},{"key":"289_CR39","unstructured":"Loccoz, N.M. (2005). High-dimensional access methods for efficient similarity queries. Technical Report TR-2005-05-05, Universite De GENEVE."},{"key":"289_CR40","doi-asserted-by":"crossref","unstructured":"Long, X., & Suel, T. (2005). Three-level caching for efficient query processing in large Web search engines. In Proceedings of WWW (pp. 257\u2013266).","DOI":"10.1145\/1060745.1060785"},{"issue":"2","key":"289_CR41","first-page":"1424","volume":"1","author":"T Luu","year":"2008","unstructured":"Luu, T., Skobeltsyn, G., Klemm, F., Puh, M., Zarko, I., Rajman, M., Aberer, K. (2008). AlvisP2P: scalable peer-to-peer text retrieval in a structured P2P network. PVLDB, 1(2), 1424\u20131427.","journal-title":"PVLDB"},{"key":"289_CR42","unstructured":"Nejdl, W., Siberski, W., Wolpers, M., Schmnitz, C. (2003). Routing and clustering in schema-based super peer networks. In Proceedings of IPTPS."},{"key":"289_CR43","doi-asserted-by":"crossref","unstructured":"Nejdl, W., Wolpers, M., Siberski, W., L\u00f6ser, A., Bruckhorst, I., Schlosser, M., Schmitz, C. (2003). Super-peer-based routing and clustering strategies for rdf-based peer-to-peer networks. In Proceedings of the 12nd international world wide web conference.","DOI":"10.1145\/775152.775229"},{"key":"289_CR44","unstructured":"Niblack, C.W., Barber, R., Equitz, W., Flickner, M.D., Glasman, E.H., Petkovic, D., Yanker, P., Faloutsos, C., Taubin, G. (1993). The QBIC project: querying images by content using color, texture and shape. In Proceedings of SPIE: storage and retrieval for image and video database."},{"key":"289_CR45","unstructured":"Panigrahy, R. (2006). Nearest neighbor search using kd-trees. Technical report, Stanford University."},{"issue":"2","key":"289_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1459352.1459357","volume":"41","author":"X Qi","year":"2009","unstructured":"Qi, X., & Davison, B. (2009). Web page classification: features and algorithms. ACM Computing Surveys, 41(2), 1\u201331.","journal-title":"ACM Computing Surveys"},{"key":"289_CR47","unstructured":"Salton, G., & McGill, M. (1983). Introduction to modern information retrieval. International Student Edition, McGraw-Hill."},{"key":"289_CR48","unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C. (1997). Multidimensional access methods: trees have grown everywhere. In Proceedings of the 23rd international conference on very large data bases."},{"key":"289_CR49","doi-asserted-by":"crossref","unstructured":"Shen, H., Li, Z., Li, T. (2008). An investigation on multi-token list based proximity search in multi-dimensional massive database. In Proceedings of the international conference on convergence and hybrid information technology (ICCIT).","DOI":"10.1109\/ICCIT.2008.277"},{"issue":"1","key":"289_CR50","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.future.2008.03.006","volume":"25","author":"G Skobeltsyn","year":"2009","unstructured":"Skobeltsyn, G., Luu, T., Zarko, I., Rajman, M., Aberer, K. (2009). Query-driven indexing for scalable peer-to-peer text retrieval. Future Generation Computing Systems, 25(1), 89\u201399.","journal-title":"Future Generation Computing Systems"},{"issue":"1","key":"289_CR51","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/MIC.2011.140","volume":"16","author":"C Weth","year":"2012","unstructured":"Weth, C., & Datta, A. (2012). Multiterm keyword search in NoSQL systems. IEEE Internet Computing, 16(1), 34\u201342.","journal-title":"IEEE Internet Computing"},{"key":"289_CR52","unstructured":"White, D.A., & Jain, R. (1996). Algorithm and strategies for similarity retrieval. Technical Report VCL-96-101, University of California."},{"key":"289_CR53","unstructured":"Yianlios, P.N. (1993). Data structures and algorithms for nearest neighbor search in general metric spaces. In Proceedings of the fourth annual ACM-SIAM symposium on discrete algorithms."},{"key":"289_CR54","doi-asserted-by":"crossref","unstructured":"Zolotarev, V.M. (1986). One-dimensional stable distributions. American Mathematical Society.","DOI":"10.1090\/mmono\/065"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-013-0289-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-013-0289-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-013-0289-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T10:03:22Z","timestamp":1564999402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-013-0289-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,27]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["289"],"URL":"https:\/\/doi.org\/10.1007\/s10844-013-0289-9","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,27]]}}}