{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:39:58Z","timestamp":1725475198899},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540692690"},{"type":"electronic","value":"9783540692706"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11965893_23","type":"book-chapter","created":{"date-parts":[[2006,12,7]],"date-time":"2006-12-07T07:52:22Z","timestamp":1165477942000},"page":"329-343","source":"Crossref","is-referenced-by-count":6,"title":["Combining Incompleteness and Ranking in Tree Queries"],"prefix":"10.1007","author":[{"given":"Benny","family":"Kimelfeld","sequence":"first","affiliation":[]},{"given":"Yehoshua","family":"Sagiv","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Cohen, S., Fadida, I., Kanza, Y., Kimelfeld, B., Sagiv, Y.: Full disjunctions: Polynomial-delay iterators in action. In: VLDB (2006)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Fuhr, N., Gro\u00dfjohann, K.: XIRQL: A query language for information retrieval in XML documents. In: SIGIR (2001)","DOI":"10.1145\/383952.383985"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Galindo-Legaria, C.: Outerjoins as disjunctions. In: SIGMOD (1994)","DOI":"10.1145\/191839.191908"},{"key":"23_CR4","unstructured":"Goldman, R., Shivakumar, N., Venkatasubramanian, S., Garcia-Molina, H.: Proximity search in databases. In: VLDB (1998)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. In: VLDB (2003)","DOI":"10.1016\/B978-012722442-8\/50072-0"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Johnson, D., Yannakakis, M., Papadimitriou, C.: On generating all maximal independent sets. Information Processing Letters\u00a027 (1988)","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Kanza, Y., Nutt, W., Sagiv, Y.: Queries with incomplete answers over semistructured data. In: PODS (1999)","DOI":"10.1145\/303976.303999"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Kanza, Y., Nutt, W., Sagiv, Y.: Querying incomplete information in semistructured data. J. Comput. Syst. Sci.\u00a064(3) (2002)","DOI":"10.1006\/jcss.2001.1811"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Kanza, Y., Sagiv, Y.: Flexible queries over semistructured data. In: PODS (2001)","DOI":"10.1145\/375551.375558"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Kimelfeld, B., Sagiv, Y.: Finding and approximating top-k answers in keyword proximity search. In: PODS (2006)","DOI":"10.1145\/1142351.1142377"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Kimelfeld, B., Sagiv, Y.: Incrementally computing ordered answers of acyclic conjunctive queries. In: NGITS (2006)","DOI":"10.1007\/11780991_13"},{"key":"23_CR12","unstructured":"Kimelfeld, B., Sagiv, Y.: Twig patterns: From XML trees to graphs. In: WebDB (2006)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Lawler, E.L.: A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Science\u00a018 (1972)","DOI":"10.1287\/mnsc.18.7.401"},{"key":"23_CR14","unstructured":"Natsev, A., Chang, Y.C., Smith, J.R., Li, C.S., Vitter, J.S.: Supporting incremental join queries on ranked inputs. In: VLDB (2001)"},{"key":"23_CR15","unstructured":"Theobald, M., Schenkel, R., Weikum, G.: An efficient and versatile query engine for TopX search. In: VLDB (2005)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Trotman, A., Sigurbj\u00f6rnsson, B.: Narrowed Extended XPath I (NEXI). In: INEX (2004)","DOI":"10.1007\/11424550_2"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Vagena, Z., Moro, M.M., Tsotras, V.J.: Twig query processing over graph-structured XML data. In: WebDB (2004)","DOI":"10.1145\/1017074.1017087"},{"key":"23_CR18","unstructured":"Yen, J.Y.: Another algorithm for finding the k shortest loopless network paths. In: Proc. 41st Mtg. Operations Research Society of America, vol.\u00a020 (1972)"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2013 ICDT 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11965893_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:23:25Z","timestamp":1619508205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11965893_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540692690","9783540692706"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11965893_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}