메뉴 건너뛰기




Volumn , Issue , 2005, Pages 31-38

AutoJoin: Providing freedom from specifying joins

Author keywords

Ambiguity; Database; Inference; Interface; Query; Schema

Indexed keywords

AMBIGUITY; DATABASE; INFERENCE; INTERFACE; QUERY; SCHEMA;

EID: 78649307227     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (6)

References (11)
  • 1
    • 0036205387 scopus 로고    scopus 로고
    • DBXplorer: A system for keyword-based search over relational databases
    • Agrawal, S., Chaudhuri, S., and Das, G. (2002). DBXplorer: A System for Keyword-Based Search Over Relational Databases. In IEEE ICDE, pages 5-16.
    • (2002) IEEE ICDE , pp. 5-16
    • Agrawal, S.1    Chaudhuri, S.2    Das, G.3
  • 2
    • 85068537403 scopus 로고    scopus 로고
    • ObjectRank: Authority-based keyword search in databases
    • Balmin, A., Hristidis, V., and Papakonstantinou, Y. (2004). ObjectRank:Authority-Based Keyword Search in Databases. In VLDB, pages 564-575.
    • (2004) VLDB , pp. 564-575
    • Balmin, A.1    Hristidis, V.2    Papakonstantinou, Y.3
  • 3
    • 0034187583 scopus 로고    scopus 로고
    • What happend when database researchers met usability
    • Catarci, T. (2000). What happend when Database Researchers met Usability. Information Systems, 25(3):177-212.
    • (2000) Information Systems , vol.25 , Issue.3 , pp. 177-212
    • Catarci, T.1
  • 4
    • 0009769065 scopus 로고
    • Finding all spanning trees of directed and undirected graphs
    • Gabow, H. and Myers, E. (1978). Finding All Spanning Trees of Directed and Undirected Graphs. SIAM Journal of Computing, 7(3):280-287.
    • (1978) SIAM Journal of Computing , vol.7 , Issue.3 , pp. 280-287
    • Gabow, H.1    Myers, E.2
  • 5
    • 0344811244 scopus 로고    scopus 로고
    • DISCOVER: Keyword search in relational datbases
    • Hristidis, V. and Papakonstantinou, Y. (2002). DISCOVER: Keyword Search in Relational Datbases. In VLDB, pages 670-681.
    • (2002) VLDB , pp. 670-681
    • Hristidis, V.1    Papakonstantinou, Y.2
  • 6
    • 0020720446 scopus 로고
    • Maximal objects and the semantics of universal relation databases
    • Maier, D. and Ullman, J. (1983). Maximal Objects and the Semantics of Universal Relation Databases. TODS, 8(1):1-14.
    • (1983) TODS , vol.8 , Issue.1 , pp. 1-14
    • Maier, D.1    Ullman, J.2
  • 7
    • 0035440836 scopus 로고    scopus 로고
    • Enriching the conceptual basis for query formulation through relationship semantics in databases
    • Owei, V. and Navathe, S. (2001). Enriching the conceptual basis for query formulation through relationship semantics in databases. Information Systems, 26(6):445-475.
    • (2001) Information Systems , vol.26 , Issue.6 , pp. 445-475
    • Owei, V.1    Navathe, S.2
  • 8
    • 0038035863 scopus 로고    scopus 로고
    • Towards a theory of natural language interfaces to databases
    • Popescu, A., Etzioni, O., and Kautz, H. (2003). Towards a theory of natural language interfaces to databases. In IUI.
    • (2003) IUI
    • Popescu, A.1    Etzioni, O.2    Kautz, H.3
  • 9
    • 0031153764 scopus 로고    scopus 로고
    • Automated query formulation using an entity-relationship conceptual schema
    • Semmel, R. and Mayfield, J. (1997). Automated Query Formulation using an Entity-Relationship Conceptual Schema. Intelligent Information Systems, 8:267-290.
    • (1997) Intelligent Information Systems , vol.8 , pp. 267-290
    • Semmel, R.1    Mayfield, J.2
  • 10
    • 0021500078 scopus 로고
    • Resolving the query inference problem using steiner trees
    • Wald, J. and Sorenson, P. (1984). Resolving the Query Inference Problem Using Steiner Trees. TODS, 9(3):348-368.
    • (1984) TODS , vol.9 , Issue.3 , pp. 348-368
    • Wald, J.1    Sorenson, P.2


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