{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:29:39Z","timestamp":1709818179039},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,5,1]],"date-time":"2010-05-01T00:00:00Z","timestamp":1272672000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1007\/s11390-010-9336-y","type":"journal-article","created":{"date-parts":[[2010,5,10]],"date-time":"2010-05-10T04:10:10Z","timestamp":1273464610000},"page":"444-457","source":"Crossref","is-referenced-by-count":3,"title":["Context-Sensitive Document Ranking"],"prefix":"10.1007","volume":"25","author":[{"given":"Li-Jun","family":"Chang","sequence":"first","affiliation":[]},{"given":"Jeffrey","family":"Xu Yu","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,8]]},"reference":[{"key":"9336_CR1","unstructured":"Baeza-Yates R, Ribeiro-Neto B. Modern Information Retrieval. 1st Edition, Addison Wesley, May 1999."},{"key":"9336_CR2","unstructured":"Kacholia V, Pandit S, Chakrabarti S, Sudarshan S, Desai R, Karambelkar H. Bidirectional expansion for keyword search on graph databases. In Proc. VLDB2005, Trondheim, Norway, Aug. 30\u2013Sept. 2, 2005, pp.505\u2013516."},{"key":"9336_CR3","doi-asserted-by":"crossref","unstructured":"Ding B, Yu J X,Wang S, Qin L, Zhang X, Lin X. Finding top-k min-cost connected trees in databases. In Proc. ICDE 2007, Istanbul, Turkey, April 15\u201320, 2007, pp.836\u2013845.","DOI":"10.1109\/ICDE.2007.367929"},{"key":"9336_CR4","doi-asserted-by":"crossref","unstructured":"Ananthakrishna R, Chaudhuri S, Ganti V. Eliminating fuzzy duplicates in data warehouses. In Proc. VLDB2002, Hong Kong, China, Aug. 20\u201323, 2002, pp.586\u2013597.","DOI":"10.1016\/B978-155860869-6\/50058-5"},{"key":"9336_CR5","doi-asserted-by":"crossref","unstructured":"Li W S, Candan K S, Vu Q, Agrawal D. Retrieving and organizing web pages by \u201cinformation unit\u201d. In Proc. WWW2001, Hong Kong, China, May 1\u20135, 2001, pp.230\u2013244.","DOI":"10.1145\/371920.372057"},{"key":"9336_CR6","doi-asserted-by":"crossref","unstructured":"Luo Y, Lin X,Wang W, Zhou X. Spark: Top-k keyword query in relational databases. In Proc. SIGMOD2007, Beijing, China, June 11\u201314, 2007, pp.115\u2013126.","DOI":"10.1145\/1247480.1247495"},{"key":"9336_CR7","doi-asserted-by":"crossref","unstructured":"He H, Wang H, Yang J, Yu P S. Blinks: Ranked keyword searches on graphs. In Proc. SIGMOD2007, Beijing, China, June 11\u201314, 2007, pp.305\u2013316.","DOI":"10.1145\/1247480.1247516"},{"key":"9336_CR8","doi-asserted-by":"crossref","unstructured":"Soliman M A, Ilyas I F, Chang K C C. Top-k query processing in uncertain databases. In Proc. ICDE 2007, Istanbul, Turkey, April 15\u201320, 2007, pp.896\u2013905.","DOI":"10.1109\/ICDE.2007.367935"},{"issue":"12","key":"9336_CR9","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1109\/TKDE.2008.90","volume":"20","author":"K Yi","year":"2008","unstructured":"Yi K, Li F, Kollios G, Srivastava D. Efficient processing of top-k queries in uncertain databases with x-Relations. IEEE Trans. Knowl. Data Eng., 2008, 20(12): 1669\u20131682.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9336_CR10","doi-asserted-by":"crossref","unstructured":"Hua M, Pei J, Zhang W, Lin X. Ranking queries on uncertain data: A probabilistic threshold approach. In Proc. SIG-MOD2008, Vancouver, Canada, June 9\u201312, 2008, pp.673\u2013686.","DOI":"10.1145\/1376616.1376685"},{"key":"9336_CR11","doi-asserted-by":"crossref","unstructured":"Agrawal P, Benjelloun O, Sarma A D, Hayworth C, Nabar S U, Sugihara T, Widom J. Trio: A system for data, uncertainty, and lineage. In Proc. VLDB2006, Seoul, Korea, Sept. 12\u201315, 2006, pp.1151\u20131154.","DOI":"10.1007\/978-0-387-09690-2_5"},{"key":"9336_CR12","doi-asserted-by":"crossref","unstructured":"Jin C, Yi K, Chen L, Yu J X, Lin X. Sliding-window top-k queries on uncertain streams. In Proc. VLDB2008, Auckland, New Zealand, Aug. 23\u201328, 2008, pp.301\u2013312.","DOI":"10.14778\/1453856.1453892"},{"key":"9336_CR13","doi-asserted-by":"crossref","unstructured":"Cormode G, Li F, Yi K. Semantics of ranking queries for probabilistic data and expected ranks. In Proc. ICDE 2009, Shanghai, China, March 29\u2013April 2, 2009, pp.305\u2013306.","DOI":"10.1109\/ICDE.2009.75"},{"key":"9336_CR14","doi-asserted-by":"crossref","unstructured":"Li J, Deshpande A. Consensus answers for queries over probabilistic databases. In Proc. PODS2009, Providence, USA, June 29\u2013July 1, 2009, pp.259\u2013268.","DOI":"10.1145\/1559795.1559835"},{"key":"9336_CR15","doi-asserted-by":"crossref","unstructured":"Qin L, Yu J X, Chang L, Tao Y. Querying communities in relational databases. In Proc. ICDE 2009, Shanghai, China, Mar. 29\u2013Apr. 2, 2009, pp.724\u2013735.","DOI":"10.1109\/ICDE.2009.67"},{"key":"9336_CR16","doi-asserted-by":"crossref","unstructured":"Re C, Dalvi N N, Suciu D. Efficient top-k query evaluation on probabilistic data. In Proc. ICDE 2007, Istanbul, Turkey, April 15\u201320, 2007, pp.886\u2013895.","DOI":"10.1109\/ICDE.2007.367934"},{"key":"9336_CR17","doi-asserted-by":"crossref","unstructured":"J\u00e4rvelin K, Kek\u00e4l\u00e4inen J. IR evaluation methods for retrieving highly relevant documents. In Proc. SIGIR 2000, Athens, Greece, July 24\u201328, 2000, pp.41\u201348.","DOI":"10.1145\/3130348.3130374"},{"key":"9336_CR18","doi-asserted-by":"crossref","unstructured":"Burges C J C, Shaked T, Renshaw E, Lazier A, Deeds M, Hamilton N, Hullender G N. Learning to rank using gradient descent. In Proc. ICML 2005, Bonn, Germany, Aug. 7\u201311, 2005, pp.89\u201396.","DOI":"10.1145\/1102351.1102363"},{"key":"9336_CR19","doi-asserted-by":"crossref","unstructured":"Geng X, Liu T Y, Qin T, Arnold A, Li H, Shum H Y. Query dependent ranking using k-nearest neighbor. In Proc. SI-GIR 2008, Singapore, July 20\u201324, 2008, pp.115\u2013122.","DOI":"10.1145\/1390334.1390356"},{"key":"9336_CR20","doi-asserted-by":"crossref","unstructured":"Dou Z, Song R, Yuan X,Wen J R. Are click-through data adequate for learning web search rankings? In Proc. CIKM2008, Napa Valley, USA, Oct. 26\u201330, 2008, pp.73\u201382.","DOI":"10.1145\/1458082.1458095"},{"key":"9336_CR21","doi-asserted-by":"crossref","unstructured":"Chaudhuri S, Ganjam K, Ganti V, Motwani R. Robust and efficient fuzzy match for online data cleaning. In Proc. SIG-MOD2003, San Diego, USA, June 9\u201312, 2003, pp.313\u2013324.","DOI":"10.1145\/872757.872796"},{"key":"9336_CR22","doi-asserted-by":"crossref","unstructured":"Hernandez M A, Stolfo S J. The merge\/purge problem for large databases. In Proc. SIGMOD1995, San Jose, USA, May 22\u201325, 1995, pp.127\u2013138.","DOI":"10.1145\/223784.223807"},{"key":"9336_CR23","unstructured":"Cohen W W, Ravikumar P, Fienberg S E. A comparison of string distance metrics for name-matching tasks. In Proc. IIWeb 2003, Acapulco, Mexico, Aug. 9\u201310, 2003, pp.73\u201378."},{"key":"9336_CR24","doi-asserted-by":"crossref","unstructured":"Ukkonen E. On approximate string matching. In Proc. FCT, Borgholm, Sweden, Aug. 21\u201327, 1983, pp.487\u2013495.","DOI":"10.1007\/3-540-12689-9_129"},{"key":"9336_CR25","unstructured":"Gravano L, Ipeirotis P G, Jagadish H V, Koudas N, Muthukrishnan S, Srivastava D. Approximate string joins in a database (almost) for free. In Proc. VLDB2001, Rome, Italy, Sept. 11\u201314, 2001, pp.491\u2013500."},{"key":"9336_CR26","doi-asserted-by":"crossref","unstructured":"Bayardo R J, Ma Y, Srikant R. Scaling up all pairs similarity search. In Proc. WWW2007, Banff, Canada, May 8\u201312, 2007, pp.131\u2013140.","DOI":"10.1145\/1242572.1242591"},{"key":"9336_CR27","doi-asserted-by":"crossref","unstructured":"Xiao C, Wang W, Lin X, Yu J X. Efficient similarity joins for near duplicate detection. In Proc. WWW2008, Beijing, China, Apr. 21\u201325, 2008, pp.131\u2013140.","DOI":"10.1145\/1367497.1367516"},{"key":"9336_CR28","doi-asserted-by":"crossref","unstructured":"Bhalotia G, Hulgeri A, Nakhe C, Chakrabarti S, Sudarshan S. Keyword searching and browsing in databases using banks. In Proc. ICDE 2002, San Jose, USA, Feb. 26\u2013Mar. 1, 2002, pp.431\u2013440.","DOI":"10.1109\/ICDE.2002.994756"},{"key":"9336_CR29","doi-asserted-by":"crossref","unstructured":"Hristidis V, Papakonstantinou Y. Discover: Keyword search in relational databases. In Proc. VLDB2002, Hong Kong, China, Aug. 20\u201323, 2002, pp.670\u2013681.","DOI":"10.1016\/B978-155860869-6\/50065-2"},{"key":"9336_CR30","doi-asserted-by":"crossref","unstructured":"Hristidis V, Gravano L, Papakonstantinou Y. Efficient IR-style keyword search over relational databases. In Proc.VLDB2003, Berlin, Germany, Sept. 9\u201312, 2003, pp.850\u2013861.","DOI":"10.1016\/B978-012722442-8\/50080-X"},{"key":"9336_CR31","doi-asserted-by":"crossref","unstructured":"Agrawal S, Chaudhuri S, Das G. Dbxplorer: A system for keyword-based search over relational databases. In Proc. ICDE 2002, San Jose, USA, Feb. 26\u2013Mar. 1, 2002, p.5.","DOI":"10.1109\/ICDE.2002.994693"},{"key":"9336_CR32","doi-asserted-by":"crossref","unstructured":"Liu F, Yu C T, Meng W, Chowdhury A. Effective keyword search in relational databases. In Proc. SIGMOD2006, Chicago, USA, June 27\u201329, 2006, pp.563\u2013574.","DOI":"10.1145\/1142473.1142536"},{"key":"9336_CR33","doi-asserted-by":"crossref","unstructured":"Golenberg K, Kimelfeld B, Sagiv Y. Keyword proximity search in complex data graphs. In Proc. SIGMOD2008, Vancouver, Canada, 2008, pp.927\u2013940.","DOI":"10.1145\/1376616.1376708"},{"key":"9336_CR34","doi-asserted-by":"crossref","unstructured":"Li G, Ooi B C, Feng J, Wang J, Zhou L. Ease: An effective 3-in-1 keyword search method for unstructured, semi-structured and structured data. In Proc. SIGMOD2008, Vancouver, Canada, June 9\u201312, 2008, pp.903\u2013914.","DOI":"10.1145\/1376616.1376706"},{"key":"9336_CR35","doi-asserted-by":"crossref","unstructured":"Sayyadian M, LeKhac H, Doan A, Gravano L. Efficient keyword search across heterogeneous relational databases. In Proc. ICDE 2007, Istanbul, Turkey, April 15\u201320, 2007, pp.346\u2013355.","DOI":"10.1109\/ICDE.2007.367880"},{"key":"9336_CR36","doi-asserted-by":"crossref","unstructured":"Sarma A D, Benjelloun O, Halevy A Y, Widom J. Working models for uncertain data. In Proc. ICDE 2006, Atlanta, USA, April 3\u20138, 2006, p.7.","DOI":"10.1109\/ICDE.2006.174"},{"key":"9336_CR37","unstructured":"Benjelloun O, Sarma A D, Halevy A Y, Widom J. Uldbs: Databases with uncertainty and lineage. In Proc. VLDB2006, Seoul, Korea, Sept. 12\u201315, 2006, pp.953\u2013964."},{"key":"9336_CR38","doi-asserted-by":"crossref","unstructured":"Dalvi N N, Suciu D. Management of probabilistic data: Foundations and challenges. In Proc. PODS2007, Beijing, China, June 11\u201313, 2007, pp.1\u201312.","DOI":"10.1145\/1265530.1265531"},{"issue":"4","key":"9336_CR39","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s00778-006-0004-3","volume":"16","author":"NN Dalvi","year":"2007","unstructured":"Dalvi N N, Suciu D. Efficient query evaluation on probabilistic databases. VLDB J., 2007, 16(4): 523\u2013544.","journal-title":"VLDB J."},{"key":"9336_CR40","doi-asserted-by":"crossref","unstructured":"Ljosa V, Singh A K. Top-k spatial joins of probabilistic objects. In Proc. ICDE 2008, Cancun, Mexico, Apr. 7\u201312, 2008, pp.566\u2013575.","DOI":"10.1109\/ICDE.2008.4497465"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-010-9336-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-010-9336-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-010-9336-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T03:22:35Z","timestamp":1685589755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-010-9336-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["9336"],"URL":"https:\/\/doi.org\/10.1007\/s11390-010-9336-y","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5]]}}}