메뉴 건너뛰기




Volumn , Issue , 2010, Pages 724-727

Querying the deep web

Author keywords

[No Author keywords available]

Indexed keywords

DEEP WEB; INTEGRITY CONSTRAINTS; PLAN GENERATION; PROTOTYPE SYSTEM; QUERY AND SEARCH; RELATIONAL MODEL; RUNTIMES; WEB PAGE;

EID: 77952280827     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1739041.1739138     Document Type: Conference Paper
Times cited : (22)

References (22)
  • 1
    • 77951614325 scopus 로고    scopus 로고
    • Data integration for the relational web
    • Michael J. Cafarella, Alon Y. Halevy, and Nodira Khoussainova. Data integration for the relational web. PVLDB, 2(1):1090-1101, 2009.
    • (2009) PVLDB , vol.2 , Issue.1 , pp. 1090-1101
    • Cafarella, M.J.1    Halevy, A.Y.2    Khoussainova, N.3
  • 2
    • 65349107649 scopus 로고    scopus 로고
    • Dynamic query optimization under access limitations and dependencies
    • Andrea Calì, Diego Calvanese, and Davide Martinenghi. Dynamic query optimization under access limitations and dependencies. Journal of Universal Computer Science, 15(21):33-62, 2009.
    • (2009) Journal of Universal Computer Science , vol.15 , Issue.21 , pp. 33-62
    • Calì, A.1    Calvanese, D.2    Martinenghi, D.3
  • 3
    • 57049154628 scopus 로고    scopus 로고
    • Conjunctive query containment under access limitations
    • Andrea Calí and Davide Martinenghi. Conjunctive query containment under access limitations. In Proc. of ER, pages 326-340, 2008.
    • (2008) Proc. of ER , pp. 326-340
    • Calí, A.1    Martinenghi, D.2
  • 4
    • 52649085759 scopus 로고    scopus 로고
    • Querying data under access limitations
    • Andrea Calì and Davide Martinenghi. Querying data under access limitations. In Proc. of ICDE, pages 50-59, 2008.
    • (2008) Proc. of ICDE , pp. 50-59
    • Calì, A.1    Martinenghi, D.2
  • 5
    • 0022186245 scopus 로고
    • And-parallelism with intelligent backtracking for annotated logic programs
    • Piotr Dembinski and Jan Maluszynski. And-parallelism with intelligent backtracking for annotated logic programs. In Proc. of Symp. on Logic Programming, pages 29-38, 1985.
    • (1985) Proc. of Symp. on Logic Programming , pp. 29-38
    • Dembinski, P.1    Maluszynski, J.2
  • 6
    • 33846828477 scopus 로고    scopus 로고
    • Rewriting queries using views with access patterns under integrity constraints
    • Alin Deutsch, Bertram Ludäscher, and Alan Nash. Rewriting queries using views with access patterns under integrity constraints. Theoretical Computer Science, 371(3):200-226, 2007.
    • (2007) Theoretical Computer Science , vol.371 , Issue.3 , pp. 200-226
    • Deutsch, A.1    Ludäscher, B.2    Nash, A.3
  • 7
    • 0000716692 scopus 로고    scopus 로고
    • Recursive plans for information gathering
    • Oliver M. Duschka and Alon Y. Levy. Recursive plans for information gathering. In Proc. of IJCAI, pages 778-784, 1997.
    • (1997) Proc. of IJCAI , pp. 778-784
    • Duschka, O.M.1    Levy, A.Y.2
  • 8
    • 0345870313 scopus 로고    scopus 로고
    • Query optimization in the presence of limited access patterns
    • Daniela Florescu, Alon Y. Levy, Ioana Manolescu, and Dan Suciu. Query optimization in the presence of limited access patterns. In Proc of SIGMOD, pages 311-322, 1999.
    • (1999) Proc of SIGMOD , pp. 311-322
    • Florescu, D.1    Levy, A.Y.2    Manolescu, I.3    Suciu, D.4
  • 9
    • 3142745227 scopus 로고    scopus 로고
    • The Lixto data extraction project - Back and forth between theory and practice
    • Georg Gottlob, Christoph Koch, Robert Baumgartner, Marcus Herzog, and Sergio Flesca. The Lixto data extraction project - Back and forth between theory and practice. In Proc. of PODS, pages 1-12, 2004.
    • (2004) Proc. of PODS , pp. 1-12
    • Gottlob, G.1    Koch, C.2    Baumgartner, R.3    Herzog, M.4    Flesca, S.5
  • 10
    • 0035658039 scopus 로고    scopus 로고
    • Answering queries using views: A survey
    • DOI 10.1007/s007780100054
    • Alon Y. Halevy. Answering queries using views: A survey. VLDB Journal, 10(4):270-294, 2001. (Pubitemid 33570969)
    • (2001) VLDB Journal , vol.10 , Issue.4 , pp. 270-294
    • Halevy, A.Y.1
  • 11
    • 29844446816 scopus 로고    scopus 로고
    • Metaquerier: Querying structured web sources on-the-fly
    • Bin He, Zhen Zhang, and Kevin Chen-Chuan Chang. Metaquerier: querying structured web sources on-the-fly. In Proc. of SIGMOD, pages 927-929, 2005.
    • (2005) Proc. of SIGMOD , pp. 927-929
    • He, B.1    Zhang, Z.2    Chang, K.C.-C.3
  • 12
    • 33745599137 scopus 로고    scopus 로고
    • Wise-integrator: A system for extracting and integrating complex web search interfaces of the deep web
    • Hai He, Weiyi Meng, Clement T. Yu, and Zonghuan Wu. Wise-integrator: A system for extracting and integrating complex web search interfaces of the deep web. In Proc. of VLDB, pages 1314-1317, 2005.
    • (2005) Proc. of VLDB , pp. 1314-1317
    • He, H.1    Meng, W.2    Yu, C.T.3    Wu, Z.4
  • 13
    • 0142231580 scopus 로고    scopus 로고
    • Computing complete answers to queries in the presence of limited access patterns
    • Chen Li. Computing complete answers to queries in the presence of limited access patterns. VLDB Journal, 12(3):211-227, 2003.
    • (2003) VLDB Journal , vol.12 , Issue.3 , pp. 211-227
    • Li, C.1
  • 14
    • 0142228522 scopus 로고    scopus 로고
    • Answering queries with useful bindings
    • Chen Li and Edward 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.2
  • 15
    • 21144448174 scopus 로고    scopus 로고
    • Processing union of conjunctive queries with negation under limited access patterns
    • Bertram Ludäscher and Alan Nash. Processing union of conjunctive queries with negation under limited access patterns. In Proc. of EDBT, pages 422-440, 2004.
    • (2004) Proc. of EDBT , pp. 422-440
    • Ludäscher, B.1    Nash, A.2
  • 17
    • 0038266970 scopus 로고    scopus 로고
    • Query containment for data integration systems
    • Todd D. Millstein, Alon Y. Halevy, and Marc Friedman. Query containment for data integration systems. JCSS, 66(1):20-39, 2003.
    • (2003) JCSS , vol.66 , Issue.1 , pp. 20-39
    • Millstein, T.D.1    Halevy, A.Y.2    Friedman, M.3
  • 18
    • 3142702779 scopus 로고    scopus 로고
    • Processing first-order queries under limited access patterns
    • Alan Nash and Bertram Ludäscher. Processing first-order queries under limited access patterns. In Proc. of PODS, pages 307-318, 2004.
    • (2004) Proc. of PODS , pp. 307-318
    • Nash, A.1    Ludäscher, B.2
  • 20
    • 0029193408 scopus 로고
    • Answering queries using templates with binding patterns
    • Anand Rajaraman, Yehoshua Sagiv, and Jeffrey D. Ullman. Answering queries using templates with binding patterns. In Proc. of PODS, pages 105-112, 1995.
    • (1995) Proc. of PODS , pp. 105-112
    • Rajaraman, A.1    Sagiv, Y.2    Ullman, J.D.3
  • 21
    • 50249126748 scopus 로고    scopus 로고
    • Efficiently ordering subgoals with access constraints
    • Guizhen Yang, Michael Kifer, and Vinay K. Chaudhri. Efficiently ordering subgoals with access constraints. In Proc. of PODS, pages 22-22, 2006.
    • (2006) Proc. of PODS , pp. 22-22
    • Yang, G.1    Kifer, M.2    Chaudhri, V.K.3


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