{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T05:47:35Z","timestamp":1776145655383,"version":"3.50.1"},"reference-count":67,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2022,3,10]],"date-time":"2022-03-10T00:00:00Z","timestamp":1646870400000},"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":["ACM Trans. Manage. Inf. Syst."],"published-print":{"date-parts":[[2022,6,30]]},"abstract":"<jats:p>Search is probably the most common activity that humans conduct all the time. A search target can be a concrete item (with a yes or no answer and location information), an abstract concept (such as the most important information on the Web about Xindong Wu), or a plan\/path for a specific target with an objective function (like flight scheduling with a minimal travel time), among others. In this article, we propose a Universal Connection Theorem (UCT) to suggest that all physical objects\/items in the universe are connected through explicit or implicit relationships. Search is to explore the relationships, using different computing methods, to retrieve relevant objects. Under the UCT theorem, we summarize mainstream search approaches into two categories from the user perspective, deterministic search vs. abstract search, and further distinguish them into three computing paradigms: planning based search, data driven search, and knowledge enhanced search. The planning based paradigm explores search as a planning process in a large search space, by graph traversing with heuristic principles to locate optimal solutions. The data driven paradigm seeks to find objects matching the user's query from a large data repository. Indexing, hashing, information retrieval, and recommendations are typical strategies to tackle the data volumes and select the best answers for users\u2019 queries. The knowledge enhanced search does not aim to find matching objects, but to discover and then meet user's search requirements through knowledge mining. The evolution of these three search paradigms, from planning to data engineering and knowledge engineering, provides increasing levels of challenges and opportunities. This article elaborates the respective principles of these paradigms.<\/jats:p>","DOI":"10.1145\/3495214","type":"journal-article","created":{"date-parts":[[2022,3,10]],"date-time":"2022-03-10T14:05:52Z","timestamp":1646921152000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["The Evolution of Search: Three Computing Paradigms"],"prefix":"10.1145","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-1704","authenticated-orcid":false,"given":"Xindong","family":"Wu","sequence":"first","affiliation":[{"name":"Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology), Ministry of Education and Mininglamp Technology Florida Atlantic University Mininglamp Technology, Boca Raton, FL, USA"}]},{"given":"Xingquan","family":"Zhu","sequence":"additional","affiliation":[{"name":"Florida Atlantic University, Boca Raton, FL, USA"}]},{"given":"Minghui","family":"Wu","sequence":"additional","affiliation":[{"name":"Mininglamp Technology, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2022,3,10]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/B978-0-934613-67-5.50010-1","volume-title":"Search: A Survey of Recent Results, Exploring Artificial Intelligence","author":"Korf R. E.","year":"1988","unstructured":"R. E. Korf. 1988. Search: A Survey of Recent Results, Exploring Artificial Intelligence. Morgan kaufmann Publisher Inc. 197\u2013237"},{"key":"e_1_3_1_3_2","first-page":"547","volume-title":"Proceedings of the 12th International Joint Conference on Artificial Intelligence","author":"Levionson R.","year":"1991","unstructured":"R. Levionson, F.-H. Hsu, J. Schaeffer, T. A. Marsland, and D. E. Wilkins. 1991. The role of chees in artificial intelligence research. In Proceedings of the 12th International Joint Conference on Artificial Intelligence. 547\u2013552."},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00127-8"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623623"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41335-3_34"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(87)90004-X"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2187"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.14778\/3402755.3402756"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30164-8_705"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935877"},{"key":"e_1_3_1_18_2","doi-asserted-by":"crossref","unstructured":"D. Ferrucci A. Levas S. Bagchi D. Gondek and E. Mueller. 2013. Watson: Beyond Jeopardy!. Artificial Intelligence 199\u2013200 (2013) 93\u2013105.","DOI":"10.1016\/j.artint.2012.06.009"},{"key":"e_1_3_1_19_2","unstructured":"A. Singhal. Introducing the Knowledge Graph: Things not Strings Official Blog (of Google). Retrieved 22 Nov. 2020 from http:\/\/googleblog.blogspot.com\/2012\/05\/introducing-knowledge-graph-things-not.html."},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00108-4"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148257"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.130"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1961.5219222"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(75)90019-3"},{"key":"e_1_3_1_27_2","first-page":"56","volume-title":"Proceedings of the Encyclopedia of Artificial Intelligence","author":"Bisiani R.","year":"1987","unstructured":"R. Bisiani. 1987. Beam search. In Proceedings of the Encyclopedia of Artificial Intelligence. S. Shapiro (Ed.). 56\u201358. Wiley & Sons."},{"issue":"2","key":"e_1_3_1_28_2","first-page":"141","article-title":"A survey of parallel distributed genetic algorithms","volume":"10","author":"Alba E.","year":"1998","unstructured":"E. Alba and J. Troya. 1998. A survey of parallel distributed genetic algorithms. Reseaux et Systems Repartis 10, 2 (1988), 141\u2013171.","journal-title":"Reseaux et Systems Repartis"},{"key":"e_1_3_1_29_2","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","author":"Zinkevich M.","year":"2010","unstructured":"M. Zinkevich, M. Weimer, L. Li, and A. Smola. 2010. Parallelized stochastic gradient descent. In Proceedings of the Advances in Neural Information Processing Systems 2010."},{"key":"e_1_3_1_30_2","first-page":"426","volume-title":"Proceedings of the 23rd VLDB Conference","author":"Ciaccia P.","year":"1997","unstructured":"P. Ciaccia, M. Patella, and P. Zezula. 1997. M-tree: An efficient access method for similarity search in metric space. In Proceedings of the 23rd VLDB Conference. 426\u2013435."},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258656"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.130"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1108\/00220410410560582"},{"key":"e_1_3_1_35_2","volume-title":"Technical Report","author":"Page L.","year":"1999","unstructured":"L. Page, S. Brin, R. Motwani, and T. Winograd. 1999. The pagerank citation ranking: Bringing order to the web. Technical Report. Stanford InfoLab 1999."},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1108\/10662240710730470"},{"key":"e_1_3_1_37_2","volume-title":"Proceedings of the 25th AAAI Conference on Artificial Intelligence","author":"Li R.","year":"2011","unstructured":"R. Li, B. Li, C. Jin, X. Xue, and X. Zhu. 2011. Tracking user-preference varying speed in collaborative filtering. In Proceedings of the 25th AAAI Conference on Artificial Intelligence."},{"issue":"5","key":"e_1_3_1_38_2","first-page":"1054","article-title":"Rating knowledge sharing in cross-domain collaborative filtering","volume":"45","author":"Li B.","year":"2015","unstructured":"B. Li, X. Zhu, R. Li, and C. Zhang. 2015. Rating knowledge sharing in cross-domain collaborative filtering. IEEE Transactions on Cybernetics 45, 5 (2015), 1054\u20131068.","journal-title":"IEEE Transactions on Cybernetics"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/14.1.55"},{"key":"e_1_3_1_40_2","volume-title":"Proceedings of the IEEE International Conference on Data Mining","author":"Yan X.","year":"2002","unstructured":"X. Yan and J. Han. 2002. gSpan: Graph-based substructure pattern mining. In Proceedings of the IEEE International Conference on Data Mining."},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkp335"},{"key":"e_1_3_1_42_2","first-page":"2934","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence","author":"Zhu X.","year":"2007","unstructured":"X. Zhu and X. Wu. 2007. Mining complex patterns across sequences with gap requirements. In Proceedings of the International Joint Conference on Artificial Intelligence. 2934\u20132941."},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2750691"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature12477"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367918"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536239"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICBK50248.2020.00080"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3047307"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098108"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403305"},{"issue":"4","key":"e_1_3_1_51_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3436892","article-title":"Search efficient binary network embedding","volume":"15","author":"Zhang D.","year":"2021","unstructured":"D. Zhang, J. Yin, X. Zhu, and C. Zhang. 2021. Search efficient binary network embedding. ACM Transactions on Knowledge Discovery from Data 15, 4 (2021) 61, 1\u201327.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa834"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3166054.3166058"},{"key":"e_1_3_1_54_2","doi-asserted-by":"crossref","unstructured":"J. Gao M. Galley and L. Li. 2019. Neural approaches to conversational AI. Foundations and Trends in Information Retrieval 13 2\u20133 ( 2019) 27\u2013298.","DOI":"10.1561\/1500000074"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3062994"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2019.1911378"},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2020.1003396"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/3307339.3342156"},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10516-011-9154-z"},{"key":"e_1_3_1_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2020.2978701"},{"key":"e_1_3_1_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/355602.361317"},{"key":"e_1_3_1_62_2","first-page":"25","volume-title":"Master's thesis","author":"Seward H. H.","year":"1954","unstructured":"H. H. Seward. 1954. Information sorting in the application of electronic digital computers to business operations. Master's thesis. Report R-232, Massachusetts Institute of Technology, Digital Computer Laboratory. 25\u201328."},{"key":"e_1_3_1_63_2","volume-title":"Six Degrees of Separation: A Play","author":"Guare John","year":"1990","unstructured":"John Guare. 1990. Six Degrees of Separation: A Play (1st. ed.). New York: Random House. ISBN 0-679-40161-X.","edition":"1"},{"key":"e_1_3_1_64_2","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2020.1003204"},{"key":"e_1_3_1_65_2","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2017.7510454"},{"key":"e_1_3_1_66_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.2972389"},{"key":"e_1_3_1_67_2","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2019.2955988"},{"key":"e_1_3_1_68_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2018.2883764"}],"container-title":["ACM Transactions on Management Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3495214","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3495214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:02Z","timestamp":1750191122000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3495214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,10]]},"references-count":67,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6,30]]}},"alternative-id":["10.1145\/3495214"],"URL":"https:\/\/doi.org\/10.1145\/3495214","relation":{},"ISSN":["2158-656X","2158-6578"],"issn-type":[{"value":"2158-656X","type":"print"},{"value":"2158-6578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,10]]},"assertion":[{"value":"2021-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-03-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}