Abstract
In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers are ignored and only maximal ones are considered. Therefore, it is important to rank answers according to their degree of incompleteness and, moreover, this ranking should be combined with other, conventional ranking techniques that are already in use (e.g., the relevance of answers to keywords). Query evaluation should take the ranking into account by computing answers incrementally, i.e., in ranked order. In particular, the evaluation process should generate the top-k answers efficiently.
We show how a semantics for incomplete answers to tree queries can be combined with common ranking techniques. In our approach, answers are rewarded for relevancy and penalized for incompleteness, where the user specifies the appropriate quantum. An incremental algorithm for evaluating tree queries is given. This algorithm enumerates in ranked order with polynomial delay, under query-and-data complexity. Our results are couched in terms of a formal framework that captures a variety of data models (e.g., relational, semistructured and XML).
This research was supported by The Israel Science Foundation (Grant 893/05).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cohen, S., Fadida, I., Kanza, Y., Kimelfeld, B., Sagiv, Y.: Full disjunctions: Polynomial-delay iterators in action. In: VLDB (2006)
Fuhr, N., Großjohann, K.: XIRQL: A query language for information retrieval in XML documents. In: SIGIR (2001)
Galindo-Legaria, C.: Outerjoins as disjunctions. In: SIGMOD (1994)
Goldman, R., Shivakumar, N., Venkatasubramanian, S., Garcia-Molina, H.: Proximity search in databases. In: VLDB (1998)
Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. In: VLDB (2003)
Johnson, D., Yannakakis, M., Papadimitriou, C.: On generating all maximal independent sets. Information Processing Letters 27 (1988)
Kanza, Y., Nutt, W., Sagiv, Y.: Queries with incomplete answers over semistructured data. In: PODS (1999)
Kanza, Y., Nutt, W., Sagiv, Y.: Querying incomplete information in semistructured data. J. Comput. Syst. Sci. 64(3) (2002)
Kanza, Y., Sagiv, Y.: Flexible queries over semistructured data. In: PODS (2001)
Kimelfeld, B., Sagiv, Y.: Finding and approximating top-k answers in keyword proximity search. In: PODS (2006)
Kimelfeld, B., Sagiv, Y.: Incrementally computing ordered answers of acyclic conjunctive queries. In: NGITS (2006)
Kimelfeld, B., Sagiv, Y.: Twig patterns: From XML trees to graphs. In: WebDB (2006)
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 18 (1972)
Natsev, A., Chang, Y.C., Smith, J.R., Li, C.S., Vitter, J.S.: Supporting incremental join queries on ranked inputs. In: VLDB (2001)
Theobald, M., Schenkel, R., Weikum, G.: An efficient and versatile query engine for TopX search. In: VLDB (2005)
Trotman, A., Sigurbjörnsson, B.: Narrowed Extended XPath I (NEXI). In: INEX (2004)
Vagena, Z., Moro, M.M., Tsotras, V.J.: Twig query processing over graph-structured XML data. In: WebDB (2004)
Yen, J.Y.: Another algorithm for finding the k shortest loopless network paths. In: Proc. 41st Mtg. Operations Research Society of America, vol. 20 (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kimelfeld, B., Sagiv, Y. (2006). Combining Incompleteness and Ranking in Tree Queries. In: Schwentick, T., Suciu, D. (eds) Database Theory – ICDT 2007. ICDT 2007. Lecture Notes in Computer Science, vol 4353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11965893_23
Download citation
DOI: https://doi.org/10.1007/11965893_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69269-0
Online ISBN: 978-3-540-69270-6
eBook Packages: Computer ScienceComputer Science (R0)