메뉴 건너뛰기




Volumn 5, Issue 7, 2012, Pages 634-645

Querying schemas with access restrictions

Author keywords

[No Author keywords available]

Indexed keywords

QUERY LANGUAGES; TEMPORAL LOGIC; WEB CRAWLER;

EID: 84863769012     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2180912.2180916     Document Type: Article
Times cited : (8)

References (20)
  • 2
    • 0034294212 scopus 로고    scopus 로고
    • Relational transducers for electronic commerce
    • S. Abiteboul, V. Vianu, B. S. Fordham, and Y. Yesha. Relational transducers for electronic commerce. JCSS, 61(2):236-269, 2000.
    • (2000) JCSS , vol.61 , Issue.2 , pp. 236-269
    • Abiteboul, S.1    Vianu, V.2    Fordham, B.S.3    Yesha, Y.4
  • 3
    • 79960198059 scopus 로고    scopus 로고
    • Determining relevance of accesses at runtime
    • M. Benedikt, G. Gottlob, and P. Senellart. Determining relevance of accesses at runtime. In PODS, 2011.
    • (2011) PODS
    • Benedikt, M.1    Gottlob, G.2    Senellart, P.3
  • 4
    • 65349107649 scopus 로고    scopus 로고
    • Dynamic query optimization under access limitations and dependencies
    • A. Calì, D. Calvanese, and D. Martinenghi. Dynamic query optimization under access limitations and dependencies. J. UCS, 15(1):33-62, 2009.
    • (2009) J. UCS , vol.15 , Issue.1 , pp. 33-62
    • Calì, A.1    Calvanese, D.2    Martinenghi, D.3
  • 5
    • 57049154628 scopus 로고    scopus 로고
    • Conjunctive query containment under access limitations
    • A. Calì and D. Martinenghi. Conjunctive query containment under access limitations. In ER, 2008.
    • (2008) ER
    • Calì, A.1    Martinenghi, D.2
  • 6
    • 0022106416 scopus 로고
    • The implication problem for functional and inclusion dependencies is undecidable
    • A. Chandra and M. Y. Vardi. The implication problem for functional and inclusion dependencies is undecidable. SIAM Journal on Computing, 14(3):671-677, 1985.
    • (1985) SIAM Journal on Computing , vol.14 , Issue.3 , pp. 671-677
    • Chandra, A.1    Vardi, M.Y.2
  • 7
    • 0031075172 scopus 로고    scopus 로고
    • On the equivalence of recursive and nonrecursive Datalog programs
    • S. Chaudhuri and M. Y. Vardi. On the equivalence of recursive and nonrecursive Datalog programs. JCSS, 54(1):61-78, 1997.
    • (1997) JCSS , vol.54 , Issue.1 , pp. 61-78
    • Chaudhuri, S.1    Vardi, M.Y.2
  • 9
    • 84863731779 scopus 로고    scopus 로고
    • Artifact systems with data dependencies and arithmetic
    • E. Damaggio, A. Deutsch, and V. Vianu. Artifact systems with data dependencies and arithmetic. In ICDT, 2011.
    • (2011) ICDT
    • Damaggio, E.1    Deutsch, A.2    Vianu, V.3
  • 10
    • 70349144063 scopus 로고    scopus 로고
    • Automatic verification of data-centric business processes
    • A. Deutsch, R. Hull, F. Patrizi, and V. Vianu. Automatic verification of data-centric business processes. In ICDT, 2009.
    • (2009) ICDT
    • Deutsch, A.1    Hull, R.2    Patrizi, F.3    Vianu, V.4
  • 11
    • 33846828477 scopus 로고    scopus 로고
    • Rewriting queries using views with access patterns under integrity constraints
    • A. Deutsch, B. Ludäscher, and A. Nash. Rewriting queries using views with access patterns under integrity constraints. Theor. Comput. Sci., 371(3):200-226, 2007.
    • (2007) Theor. Comput. Sci. , vol.371 , Issue.3 , pp. 200-226
    • Deutsch, A.1    Ludäscher, B.2    Nash, A.3
  • 12
    • 33845938560 scopus 로고    scopus 로고
    • Specification and verification of data-driven web applications
    • May
    • A. Deutsch, L. Sui, and V. Vianu. Specification and verification of data-driven web applications. JCSS, 73:442-474, May 2007.
    • (2007) JCSS , vol.73 , pp. 442-474
    • Deutsch, A.1    Sui, L.2    Vianu, V.3
  • 14
    • 70349091587 scopus 로고    scopus 로고
    • Automatic construction of simple artifact-based business processes
    • C. Fritz, R. Hull, and J. Su. Automatic construction of simple artifact-based business processes. In ICDT, 2009.
    • (2009) ICDT
    • Fritz, C.1    Hull, R.2    Su, J.3
  • 15
    • 0142231580 scopus 로고    scopus 로고
    • Computing complete answers to queries in the presence of limited access patterns
    • C. Li. Computing complete answers to queries in the presence of limited access patterns. VLDB J., 12(3):211-227, 2003.
    • (2003) VLDB J. , vol.12 , Issue.3 , pp. 211-227
    • Li, C.1
  • 16
    • 0142228522 scopus 로고    scopus 로고
    • Answering queries with useful bindings
    • C. Li and E. Y. Chang. Answering queries with useful bindings. ACM TODS, 26(3):313-343, 2001.
    • (2001) ACM TODS , vol.26 , Issue.3 , pp. 313-343
    • Li, C.1    Chang, E.Y.2
  • 17
    • 3142702779 scopus 로고    scopus 로고
    • Processing first-order queries under limited access patterns
    • A. Nash and B. Ludäscher. Processing first-order queries under limited access patterns. In PODS, 2004.
    • (2004) PODS
    • Nash, A.1    Ludäscher, B.2
  • 18
    • 0029193408 scopus 로고
    • Answering queries using templates with binding patterns
    • A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In PODS, 1995.
    • (1995) PODS
    • Rajaraman, A.1    Sagiv, Y.2    Ullman, J.D.3
  • 19
    • 0037591752 scopus 로고    scopus 로고
    • Verification of relational transducers for electronic commerce
    • M. Spielmann. Verification of relational transducers for electronic commerce. JCSS, 66(1):40-65, 2003.
    • (2003) JCSS , vol.66 , Issue.1 , pp. 40-65
    • Spielmann, M.1
  • 20
    • 0348059628 scopus 로고
    • Principles of Database and Knowledge-Base Systems
    • Press
    • J. D. Ullman. Principles of Database and Knowledge-Base Systems, V2. Comp. Sci. Press, 1989.
    • (1989) Comp. Sci. , vol.2
    • Ullman, J.D.1


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