{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:55:00Z","timestamp":1759683300982,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,5,19]],"date-time":"2010-05-19T00:00:00Z","timestamp":1274227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s00778-010-0190-x","type":"journal-article","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T15:39:59Z","timestamp":1274197199000},"page":"35-57","source":"Crossref","is-referenced-by-count":15,"title":["Scalable keyword search on large data streams"],"prefix":"10.1007","volume":"20","author":[{"given":"Lu","family":"Qin","sequence":"first","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,19]]},"reference":[{"key":"190_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Chaudhuri, S., Das, G.: DBXplorer: A system for keyword-based search over relational databases. In Proceedings of ICDE\u201902 (2002)","DOI":"10.1145\/564780.564782"},{"key":"190_CR2","doi-asserted-by":"crossref","unstructured":"Ayad, A., Naughton, J.F.: Static optimization of conjunctive queries with sliding windows over infinite streams. In Proceedings of SIGMOD\u201904, pp. 419\u2013430 (2004)","DOI":"10.1145\/1007568.1007616"},{"key":"190_CR3","doi-asserted-by":"crossref","unstructured":"Ayad, A., Naughton, J.F., Wright, S., Srivastava, U.: Approximating streamingwindow joins under cpu limitations. In Proceedings of ICDE\u201906, pp. 142 (2006)","DOI":"10.1109\/ICDE.2006.24"},{"key":"190_CR4","doi-asserted-by":"crossref","unstructured":"Balmin, A., Hristidis, V., Papakonstantinou, Y.: ObjectRank: authority-based keyword search in databases. In Proceedings of VLDB\u201904 (2004)","DOI":"10.1016\/B978-012088469-8.50051-6"},{"issue":"1","key":"190_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/322234.322238","volume":"28","author":"P.A. Bernstein","year":"1981","unstructured":"Bernstein P.A., Chiu D.-M.W.: Using semi-joins to solve relational queries. J. ACM 28(1), 25\u201340 (1981)","journal-title":"J. ACM"},{"key":"190_CR6","unstructured":"Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using BANKS. In Proceedings of ICDE\u201902 (2002)"},{"issue":"1","key":"190_CR7","first-page":"1189","volume":"1","author":"B.B. Dalvi","year":"2008","unstructured":"Dalvi B.B., Kshirsagar M., Sudarshan S.: Keyword search on external memory data graphs. PVLDB 1(1), 1189\u20131204 (2008)","journal-title":"PVLDB"},{"key":"190_CR8","doi-asserted-by":"crossref","unstructured":"Das, A., Gehrke, J., Riedewald, M.: Approximate join processing over data streams. In Proceedings of SIGMOD\u201903, pp. 40\u201351 (2003)","DOI":"10.1145\/872763.872765"},{"key":"190_CR9","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 Proceedings of ICDE\u201907 (2007)","DOI":"10.1109\/ICDE.2007.367929"},{"key":"190_CR10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1972","unstructured":"Dreyfus S.E., Wagner R.A.: The steiner problem in graphs. Networks 1, 195\u2013207 (1972)","journal-title":"Networks"},{"key":"190_CR11","doi-asserted-by":"crossref","unstructured":"Fabret, F., Jacobsen, H.-A., Llirbat, F., Pereira, J., Ross, K.A., Shasha, D.: Filtering algorithms and implementation for very fast publish\/subscribe. In Proceedings of SIGMOD\u201901 (2001)","DOI":"10.1145\/375663.375677"},{"key":"190_CR12","doi-asserted-by":"crossref","unstructured":"Golenberg, K., Kimelfeld, B., Sagiv, Y.: Keyword proximity search in complex data graphs. In Proceedings of SIGMOD\u201908 (2008)","DOI":"10.1145\/1376616.1376708"},{"key":"190_CR13","doi-asserted-by":"crossref","unstructured":"He, H., Wang, H., Yang, J., Yu, P.S.: BLINKS: ranked keyword searches on graphs. In Proceedings of SIGMOD\u201907 (2007)","DOI":"10.1145\/1247480.1247516"},{"key":"190_CR14","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Gravano, L., Papakonstantinou, Y.: Efficient IR-Style keyword search over relational databases. In Proceedings of VLDB\u201903 (2003)","DOI":"10.1016\/B978-012722442-8\/50080-X"},{"key":"190_CR15","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Hwang, H., Papakonstantinou, Y.: Authority-based keyword search in databases. ACM Trans. Database Syst. 33(1) (2008)","DOI":"10.1145\/1331904.1331905"},{"key":"190_CR16","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Papakonstantinou, Y.: DISCOVER: keyword search in relational databases. In Proceedings of VLDB\u201902 (2002)","DOI":"10.1016\/B978-155860869-6\/50065-2"},{"key":"190_CR17","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Valdivia, O., Vlachos, M., Yu, P.S.: Continuous keyword search on multiple text streams. In Proceedings of CIKM\u201906 (2006)","DOI":"10.1145\/1183614.1183738"},{"key":"190_CR18","unstructured":"Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., Karambelkar, H.: Bidirectional expansion for keyword search on graph databases. In Proceedings of VLDB\u201905 (2005)"},{"key":"190_CR19","doi-asserted-by":"crossref","unstructured":"Kang, J., Naughton, J.F., Viglas, S.: Evaluating window joins over unbounded streams. In Proceedings of ICDE\u201903, pp. 341\u2013352 (2003)","DOI":"10.1109\/ICDE.2003.1260804"},{"key":"190_CR20","doi-asserted-by":"crossref","unstructured":"Kimelfeld, B., Sagiv, Y.: Finding and approximating top-k answers in keyword proximity search. In Proceedings of PODS\u201906 (2006)","DOI":"10.1145\/1142351.1142377"},{"key":"190_CR21","doi-asserted-by":"crossref","unstructured":"Kr\u00e4mer, J., Seeger, B.: Pipes\u2014a public infrastructure for processing and exploring streams. In Proceedings of SIGMOD\u201904 (2004)","DOI":"10.1145\/1007568.1007699"},{"key":"190_CR22","doi-asserted-by":"crossref","unstructured":"Li, G., Ooi, B.C., Feng, J., Wang, J., Zhou, L.: EASE: efficient and adaptive keyword search on unstructured, semi-structured and structured data. In Proceedings of SIGMOD\u201908 (2008)","DOI":"10.1145\/1376616.1376706"},{"key":"190_CR23","doi-asserted-by":"crossref","unstructured":"Li, L., Wang, H., Li, J., Gao, H.: Efficient algorithms for skyline top-k keyword queries on xml streams. In Proceedings of DASFAA\u201909, pp. 283\u2013287 (2009)","DOI":"10.1007\/978-3-642-00887-0_24"},{"key":"190_CR24","doi-asserted-by":"crossref","unstructured":"Liu, F., Yu, C.T., Meng, W., Chowdhury, A.: Effective keyword search in relational databases. In Proceedings of SIGMOD\u201906 (2006)","DOI":"10.1145\/1142473.1142536"},{"key":"190_CR25","doi-asserted-by":"crossref","unstructured":"Luo, Y., Lin,X., Wang, W., Zhou, X.: Spark: top-k keyword query in relational databases. In Proceedings of SIGMOD\u201907 (2007)","DOI":"10.1145\/1247480.1247495"},{"key":"190_CR26","doi-asserted-by":"crossref","unstructured":"Markowetz, A., Yang, Y., Papadias, D.: Keyword search on relational data streams. In Proceedings of SIGMOD\u201907 (2007)","DOI":"10.1145\/1247480.1247548"},{"key":"190_CR27","doi-asserted-by":"crossref","unstructured":"Qin, L., Yu, J.X., Chang, L., Tao, Y.: Querying communities in relational databases. In Proceedings of ICDE\u201909 (2009)","DOI":"10.1109\/ICDE.2009.67"},{"key":"190_CR28","doi-asserted-by":"crossref","unstructured":"Qin, L., Yu, J.X., Chang, L., Tao, Y.: Scalable keyword search on large data streams. In Proceedings of ICDE\u201909, pp. 1199\u20131202 (2009)","DOI":"10.1109\/ICDE.2009.200"},{"key":"190_CR29","doi-asserted-by":"crossref","unstructured":"Srivastava, U., Widom, J.: Memory-limited execution of windowed stream joins. In Proceedings of VLDB\u201904, pp. 324\u2013335 (2004)","DOI":"10.1016\/B978-012088469-8\/50031-0"},{"issue":"4","key":"190_CR30","first-page":"324","volume":"24","author":"T.W. Yan","year":"1999","unstructured":"Yan T.W., Garcia-Molina H.: The sift information dissemination system. ACM Trans. Database Syst. 24(4), 324\u2013335 (1999)","journal-title":"ACM Trans. Database Syst."},{"key":"190_CR31","doi-asserted-by":"crossref","unstructured":"Yang, W., Shi,B.: Schema-aware keyword search over xml streams. In Proceedings of CIT\u201907, pp. 29\u201334 (2007)","DOI":"10.1109\/CIT.2007.119"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-010-0190-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-010-0190-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-010-0190-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T23:02:07Z","timestamp":1740092527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-010-0190-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,19]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["190"],"URL":"https:\/\/doi.org\/10.1007\/s00778-010-0190-x","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2010,5,19]]}}}