Abstract
Description logics (DLs) and logic programs (LPs) are important representation languages for the Semantic Web. In this paper, we address an emerging problem in such languages, namely, the problem of evaluating ranked top-k queries. Specifically, we show how to compute the top-k answers in a data-complexity tractable combination of DLs and LPs under vagueness.
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
Bruno, N., Chaudhuri, S., Gravano, L.: Top-k selection queries over relational databases: Mapping strategies and performance evaluation. ACM TODS 27(2), 153–187 (2002)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc. KR-2006, pp. 260–270 (2006)
Chang, K.C.-C., Hwang, S.-W.: Minimal probing: Supporting expensive predicates for top-k queries. In: Proc. SIGMOD-2002, pp. 346–357 (2002)
Fagin, R.: Combining fuzzy information: An overview. SIGMOD Rec. 31(2), 109–118 (2002)
Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: Proc. PODS-2001 (2001)
Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) DBISP2P 2003. LNCS, vol. 2944, pp. 754–765. Springer, Heidelberg (2004)
Ilyas, I.F., Aref, W.G., Elmagarmid, A.K., Elmongui, H.G., Shah, R., Vitter, J.S.: Adaptive rank-aware query optimization in relational databases. ACM TODS 31(4), 1257–1304 (2006)
Li, C., Chang, K.C.-C., Ilyas, I.F.: Supporting ad-hoc ranking aggregates. In: Proc. SIGMOD-2006, pp. 61–72 (2006)
Li, C., Chang, K.C.-C., Ilyas, I.F., Song, S.: RankSQL: Query algebra and optimization for relational top-k queries. In: Proc. SIGMOD-2005, pp. 131–142 (2005)
Marian, A., Bruno, N., Gravano, L.: Evaluating top-k queries over web-accessible databases. ACM TODS 29(2), 319–362 (2004)
Meghini, C., Sebastiani, F., Straccia, U.: A model of multimedia information retrieval. J. ACM 48(5), 909–970 (2001)
Ragone, A., Straccia, U., Di Noia, T., Di Sciascio, E., Donini, F.M.: Vague knowledge bases for matchmaking in P2P e-marketplaces. In: Proc. ESWC-2007, pp. 414–428 (2007)
Ré, C., Dalvi, N., Suciu, D.: Efficient top-k query evaluation on probabilistic data. In: Proc. ICDE-2007, pp. 886–895 (2007)
Soliman, M.A., Ilyas, I.F., Chang, K.C.: Top-k query processing in uncertain databases. In: Proc. ICDE-2007, pp. 896–905 (2007)
Straccia, U.: Answering vague queries in fuzzy DL-Lite. In: Proc. IPMU-2006, pp. 2238–2245 (2006)
Straccia, U.: Towards top-k query answering in deductive databases. In: Proc. SMC-2006, pp. 4873–4879 (2006)
Straccia, U.: Towards top-k query answering in description logics: The case of DL-Lite. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 439–451. Springer, Heidelberg (2006)
Straccia, U.: Towards vague query answering in logic programming for logic-based information retrieval. In: Proc. IFSA-2007, pp. 125–134 (2007)
Straccia, U., Visco, G.: DLMedia: An ontology mediated multimedia information retrieval system. In: Proc. DL-2007 (2007)
Vojtáš, P.: Fuzzy logic programming. Fuzzy Sets and Systems 124, 361–370 (2001)
Vojtáš, P.: Fuzzy logic aggregation for semantic web search for the best (top-k) answer. In: Sanchez, E. (ed.) Fuzzy Logic and the Semantic Web. Capturing Intelligence, ch. 17, pp. 341–359. Elsevier, Amsterdam (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lukasiewicz, T., Straccia, U. (2007). Top-k Retrieval in Description Logic Programs Under Vagueness for the Semantic Web. In: Prade, H., Subrahmanian, V.S. (eds) Scalable Uncertainty Management. SUM 2007. Lecture Notes in Computer Science(), vol 4772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75410-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-75410-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75407-7
Online ISBN: 978-3-540-75410-7
eBook Packages: Computer ScienceComputer Science (R0)