Abstract
The amount of data on the Web is increasing. Current exact and complete techniques for matching complex query pattern against graph-structured web data have limits. Considering web scale, exactness and completeness might have to be traded for responsiveness. We propose a new approach, allowing an affordable computation of an initial set of (possibly inexact) results, which can be incrementally refined as needed. It is based on approximate structure matching techniques, which leverage the notion of neighborhood overlap and structure index. For exact and complete result computation, evaluation results show that our incremental approach compares well with the state of the art. Moreover, approximative results can be computed in much lower response time, without compromising too much on precision.
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
Abadi, D.J., Marcus, A., Madden, S., Hollenbach, K.J.: Scalable semantic web data management using vertical partitioning. In: VLDB, pp. 411–422 (2007)
Babcock, B., Chaudhuri, S., Das, G.: Dynamic Sample Selection for Approximate Query Processing. In: SIGMOD Conference, pp. 539–550 (2003)
Bloom, B.H.: Space/Time Trade-offs in Hash Coding with Allowable Errors. Commun. ACM 13(7), 422–426 (1970)
Buneman, P., Davidson, S., Fernandez, M., Suciu, D.: Adding structure to unstructured data. In: ICDT, pp. 336–350. Springer, Heidelberg (1997)
Chakrabarti, K., Garofalakis, M.N., Rastogi, R., Shim, K.: Approximate Query Processing Using Wavelets. In: VLDB, pp. 111–122 (2000)
Chen, Q., Lim, A., Ong, K.W.: D(k)-index: an adaptive structural summary for graph-structured data. In: SIGMOD, pp. 134–144. ACM, New York (2003)
Corby, O., Dieng-Kuntz, R., Faron-Zucker, C., Gandon, F.L.: Searching the Semantic Web: Approximate Query Processing Based on Ontologies. IEEE Intelligent Systems 21(1), 20–27 (2006)
Garofalakis, M.N., Gibbons, P.B.: Approximate Query Processing: Taming the TeraBytes. In: VLDB (2001)
Goldman, R., Widom, J.: Dataguides: Enabling query formulation and optimization in semistructured databases. In: VLDB, pp. 436–445 (1997)
Harth, A., Decker, S.: Optimized Index Structures for Querying RDF from the Web. In: LA-WEB (2005)
Hurtado, C.A., Poulovassilis, A., Wood, P.T.: Ranking approximate answers to semantic web queries. In: Aroyo, L., Traverso, P., Ciravegna, F., Cimiano, P., Heath, T., Hyvönen, E., Mizoguchi, R., Oren, E., Sabou, M., Simperl, E. (eds.) ESWC 2009. LNCS, vol. 5554, pp. 263–277. Springer, Heidelberg (2009)
Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. 11, 1–11 (2008)
Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering indexes for branching path queries. In: SIGMOD, pp. 133–144 (2002)
Neumann, T., Weikum, G.: RDF-3X: a RISC-style engine for RDF. PVLDB 1(1), 647–659 (2008)
Polyzotis, N., Garofalakis, M., Ioannidis, Y.: Approximate xml query answers. In: SIGMOD 2004, pp. 263–274. ACM, New York (2004)
Tran, D.T., Ladwig, G.: Structure index for RDF data. In: Workshop on Semantic Data Management at VLDB (September 2010)
Weiss, C., Karras, P., Bernstein, A.: Hexastore: sextuple indexing for semantic web data management. In: PVLDB, vol. 1(1), pp. 1008–1019 (2008)
Zhang, L., Liu, Q., Zhang, J., Wang, H., Pan, Y., Yu, Y.: Semplore: An IR approach to scalable hybrid query of semantic web data. In: Aberer, K., Choi, K.-S., Noy, N., Allemang, D., Lee, K.-I., Nixon, L.J.B., Golbeck, J., Mika, P., Maynard, D., Mizoguchi, R., Schreiber, G., Cudré-Mauroux, P. (eds.) ASWC 2007 and ISWC 2007. LNCS, vol. 4825, pp. 652–665. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tran, T., Ladwig, G., Wagner, A. (2011). Approximate and Incremental Processing of Complex Queries against the Web of Data. In: Hameurlain, A., Liddle, S.W., Schewe, KD., Zhou, X. (eds) Database and Expert Systems Applications. DEXA 2011. Lecture Notes in Computer Science, vol 6861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23091-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-23091-2_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23090-5
Online ISBN: 978-3-642-23091-2
eBook Packages: Computer ScienceComputer Science (R0)