메뉴 건너뛰기




Volumn 6496 LNCS, Issue PART 1, 2010, Pages 631-646

Combining approximation and relaxation in semantic web path queries

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; POLYNOMIAL APPROXIMATION; QUERY LANGUAGES;

EID: 78650868422     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17746-0_40     Document Type: Conference Paper
Times cited : (28)

References (18)
  • 1
    • 70549103489 scopus 로고    scopus 로고
    • Flexible SPARQL querying of web data tables driven by an ontology
    • Buche, P., Dibie-Barthélemy, J., Chebil, H.: Flexible SPARQL querying of web data tables driven by an ontology. In: Proc. FQAS, pp. 345-357 (2009)
    • (2009) Proc. FQAS , pp. 345-357
    • Buche, P.1    Dibie-Barthélemy, J.2    Chebil, H.3
  • 2
    • 0005379501 scopus 로고    scopus 로고
    • Containment of conjunctive regular path queries with inverse
    • Calvanese, D., Giacomo, G.D., Lenzerini, M., Vardi, M.Y.: Containment of conjunctive regular path queries with inverse. In: Proc. KR, pp. 176-185 (2000)
    • (2000) Proc. KR , pp. 176-185
    • Calvanese, D.1    Giacomo, G.D.2    Lenzerini, M.3    Vardi, M.Y.4
  • 5
    • 70849123514 scopus 로고    scopus 로고
    • Robust and efficient algorithms for rank join evaluation
    • Finger, J., Polyzotis, N.: Robust and efficient algorithms for rank join evaluation. In: Proc. ACM SIGMOD, pp. 415-428 (2009)
    • (2009) Proc. ACM SIGMOD , pp. 415-428
    • Finger, J.1    Polyzotis, N.2
  • 6
    • 0038540757 scopus 로고    scopus 로고
    • The complexity of acyclic conjunctive queries
    • Gottlob, G., Leone, N., Scarcello, F.: The complexity of acyclic conjunctive queries. J. ACM 43(3), 431-498 (2001)
    • (2001) J. ACM , vol.43 , Issue.3 , pp. 431-498
    • Gottlob, G.1    Leone, N.2    Scarcello, F.3
  • 7
    • 33645666606 scopus 로고    scopus 로고
    • Regular path queries under approximate semantics
    • Grahne, G., Thomo, A.: Regular path queries under approximate semantics. Ann. Math. Artif. Intell. 46(1-2), 165-190 (2006)
    • (2006) Ann. Math. Artif. Intell. , vol.46 , Issue.1-2 , pp. 165-190
    • Grahne, G.1    Thomo, A.2
  • 9
    • 9344230770 scopus 로고    scopus 로고
    • RDF Semantics
    • February10
    • Hayes, P. (ed.): RDF Semantics, W3C Recommendation, (February10, 2004)
    • (2004) W3C Recommendation
    • Hayes, P.1
  • 11
    • 52149121542 scopus 로고    scopus 로고
    • Computing relaxed answers on RDF databases
    • Bailey, J., Maier, D., Schewe, K.-D., Thalheim, B., Wang, X.S. (eds.) WISE 2008. Springer, Heidelberg
    • Huang, H., Liu, C., Zhou, X.: Computing relaxed answers on RDF databases. In: Bailey, J., Maier, D., Schewe, K.-D., Thalheim, B., Wang, X.S. (eds.) WISE 2008. LNCS, vol. 5175, pp. 163-175. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5175 , pp. 163-175
    • Huang, H.1    Liu, C.2    Zhou, X.3
  • 13
    • 69849103373 scopus 로고    scopus 로고
    • Ranking approximate answers to semantic web queries
    • Aroyo, L., Traverso, P., Ciravegna, F., Cimiano, P., Heath, T., Hyvönen, E., Mizoguchi, R., Oren, E., Sabou, M., Simperl, E. (eds.) ESWC 2009. Springer, Heidelberg
    • 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)
    • (2009) LNCS , vol.5554 , pp. 263-277
    • Hurtado, C.A.1    Poulovassilis, A.2    Wood, P.T.3
  • 14
    • 0034826250 scopus 로고    scopus 로고
    • Flexible queries over semistructured data
    • Kanza, Y., Sagiv, Y.: Flexible queries over semistructured data. In: Proc. PODS, pp. 40-51 (2001)
    • (2001) Proc. PODS , pp. 40-51
    • Kanza, Y.1    Sagiv, Y.2
  • 15
    • 49949095781 scopus 로고    scopus 로고
    • The fundamentals of iSPARQL: A virtual triple approach for similarity-based semantic web tasks
    • 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. Springer, Heidelberg
    • Kiefer, C., Bernstein, A., Stocker, M.: The fundamentals of iSPARQL: A virtual triple approach for similarity-based semantic web tasks. 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. 295-309. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4825 , pp. 295-309
    • Kiefer, C.1    Bernstein, A.2    Stocker, M.3
  • 16
    • 77955231128 scopus 로고    scopus 로고
    • Adaptive relaxation for querying heterogeneous XML data sources
    • Liu, C., Li, J., Yu, J.X., Zhou, R.: Adaptive relaxation for querying heterogeneous XML data sources. Information Systems 35(6), 688-707 (2010)
    • (2010) Information Systems , vol.35 , Issue.6 , pp. 688-707
    • Liu, C.1    Li, J.2    Yu, J.X.3    Zhou, R.4
  • 17
    • 0029190384 scopus 로고
    • Finding regular simple paths in graph databases
    • Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. SIAM J. Computing 24(6), 1235-1258 (1995)
    • (1995) SIAM J. Computing , vol.24 , Issue.6 , pp. 1235-1258
    • Mendelzon, A.O.1    Wood, P.T.2
  • 18
    • 77954303174 scopus 로고    scopus 로고
    • Answering approximate queries over autonomous web databases
    • Meng, X., Ma, Z.M., Yan, L.: Answering approximate queries over autonomous web databases. In: Proc. WWW, pp. 1021-1030 (2009)
    • (2009) Proc. WWW , pp. 1021-1030
    • Meng, X.1    Ma, Z.M.2    Yan, L.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.