메뉴 건너뛰기




Volumn 1, Issue 1, 2008, Pages 1189-1204

Keyword search on external memory data graphs

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; SEARCH ENGINES;

EID: 68349138437     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1453856.1453982     Document Type: Article
Times cited : (88)

References (25)
  • 1
    • 0036205387 scopus 로고    scopus 로고
    • DBXplorer: A system for keyword-based search search over relational databases
    • Sanjay Agrawal, Surajit Chaudhari, and Gautam Das. DBXplorer: A system for keyword-based search search over relational databases. ICDE, 2002.
    • (2002) ICDE
    • Agrawal, S.1    Chaudhari, S.2    Das, G.3
  • 2
    • 28444467516 scopus 로고    scopus 로고
    • Vagelis Hristidis, and Yannis Papakonstantinou. ObjectRank: authority-based keyword search in databases
    • Andrey Balmin, Vagelis Hristidis, and Yannis Papakonstantinou. ObjectRank: authority-based keyword search in databases. In VLDB, 2004.
    • (2004) VLDB
    • Balmin, A.1
  • 6
    • 0033881720 scopus 로고    scopus 로고
    • Maintaining hierarchical graph views
    • A. L. Buchsbaum and J. Westbrook. Maintaining hierarchical graph views. In SODA, pages 566-575, 2000.
    • (2000) SODA , pp. 566-575
    • Buchsbaum, A.L.1    Westbrook, J.2
  • 7
    • 35348854191 scopus 로고    scopus 로고
    • Spin: searching personal information networks
    • Soumen Chakrabarti, Jeetendra Mirchandani, and Arnab Nandi. Spin: searching personal information networks. In SIGIR, page 674, 2005.
    • (2005) SIGIR , pp. 674
    • Chakrabarti, S.1    Mirchandani, J.2    Nandi, A.3
  • 8
    • 0035758238 scopus 로고    scopus 로고
    • Finding shortest paths in large network systems
    • Edward P. F. Chan and Ning Zhang. Finding shortest paths in large network systems. ACM-GIS, pages 160-166, 2001.
    • (2001) ACM-GIS , pp. 160-166
    • Chan, E.P.F.1    Zhang, N.2
  • 9
    • 34548795315 scopus 로고    scopus 로고
    • Finding top-k min-cost connected trees in databases
    • Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao Zhang, and Xuemin Lin. Finding top-k min-cost connected trees in databases. ICDE, 2007.
    • (2007) ICDE
    • Ding, B.1    Yu, J.X.2    Wang, S.3    Qin, L.4    Zhang, X.5    Lin, X.6
  • 10
    • 33745619022 scopus 로고    scopus 로고
    • The SphereSearch engine for unified ranked retrieval of heterogeneous XML and web documents
    • J. Graupmann, R. Schenkel, and G. Weikum. The SphereSearch engine for unified ranked retrieval of heterogeneous XML and web documents. In VLDB, 2005.
    • (2005) VLDB
    • Graupmann, J.1    Schenkel, R.2    Weikum, G.3
  • 11
  • 13
    • 35448999368 scopus 로고    scopus 로고
    • BLINKS:ranked keyword searches on graphs
    • Hao He, Haixun Wang, Jun Yang, and Philip S. Yu. BLINKS:ranked keyword searches on graphs. In SIGMOD, pages 305-316, 2007.
    • (2007) SIGMOD , pp. 305-316
    • He, H.1    Wang, H.2    Yang, J.3    Yu, P.S.4
  • 14
    • 0344811244 scopus 로고    scopus 로고
    • Efficient IR-Style keyword search in relational databases
    • V. Hristidis, L. Gravano, and Y. Papakonstantinou. Efficient IR-Style keyword search in relational databases. VLDB, 2002.
    • (2002) VLDB
    • Hristidis, V.1    Gravano, L.2    Papakonstantinou, Y.3
  • 15
    • 0344811244 scopus 로고    scopus 로고
    • DISCOVER: Keyword search in relational databases
    • V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword search in relational databases. In VLDB, 2002.
    • (2002) VLDB
    • Hristidis, V.1    Papakonstantinou, Y.2
  • 16
    • 33745334474 scopus 로고    scopus 로고
    • Bidirectional expansion for keyword search on graph databases
    • Varun Kacholia, Shashank Pandit, Soumen Chakrabarti, S. Sudarshan, Rushi Desai, and Hrishikesh Karambelkar. Bidirectional expansion for keyword search on graph databases. VLDB 2005, pages 505-516, 2005.
    • (2005) VLDB , vol.2005 , pp. 505-516
    • Kacholia, V.1    Pandit, S.2    Chakrabarti, S.3    Sudarshan, S.4    Desai, R.5    Karambelkar, H.6
  • 17
    • 0029430699 scopus 로고
    • Analysis of multilevel graph partitioning
    • G. Karypis and V. Kumar. Analysis of multilevel graph partitioning. In Supercomputing, 1995.
    • (1995) Supercomputing
    • Karypis, G.1    Kumar, V.2
  • 18
    • 0027840823 scopus 로고
    • Efficient out-of-core algorithms for linear relaxation using blocking covers (extended abstract)
    • Charles E. Leiserson, Satish Rao, and Sivan Toledo. Efficient out-of-core algorithms for linear relaxation using blocking covers (extended abstract). In FOCS, pages 704-713, 1993.
    • (1993) FOCS , pp. 704-713
    • Leiserson, C.E.1    Rao, S.2    Toledo, S.3
  • 19
    • 0036648582 scopus 로고    scopus 로고
    • Query relaxation by structure and semantics for retrieval of logical web documents
    • W. S. Li, K. S. Candan, Q. Vu, and D. Agrawal. Query relaxation by structure and semantics for retrieval of logical web documents. IEEE Trans. Knowl. Data Eng., page 14(4), 2002.
    • (2002) IEEE Trans. Knowl. Data Eng. , vol.14 , Issue.4
    • Li, W.S.1    Candan, K.S.2    Vu, Q.3    Agrawal, D.4
  • 20
    • 33845937754 scopus 로고    scopus 로고
    • Effective keyword search in relational databases
    • F. Liu, C. T. Yu, W. Meng, and A. Chowdhury. Effective keyword search in relational databases. In SIGMOD, 2006.
    • (2006) SIGMOD
    • Liu, F.1    Yu, C.T.2    Meng, W.3    Chowdhury, A.4
  • 21
    • 35448984017 scopus 로고    scopus 로고
    • Spark: Top-k keyword query in relational databases
    • Yi Luo, Xuemin Lin, Wei Wang, and Xiaofang Zhou. Spark: Top-k keyword query in relational databases. In SIGMOD, 2007.
    • (2007) SIGMOD
    • Luo, Y.1    Lin, X.2    Wang, W.3    Zhou, X.4
  • 22
  • 23
    • 0344927784 scopus 로고    scopus 로고
    • Representing Web graphs
    • Sriram Raghavan and Hector Garcia-Molina. Representing Web graphs. ICDE, pages 405-416, 2003.
    • (2003) ICDE , pp. 405-416
    • Raghavan, S.1    Garcia-Molina, H.2
  • 24
    • 84885602912 scopus 로고    scopus 로고
    • Materialization trade-offs in hierarchical shortest path algorithms
    • Shashi Shekhar, Andrew Fetterer, and Bjajesh Goyal. Materialization trade-offs in hierarchical shortest path algorithms. In SSD, pages 94-111, 1997.
    • (1997) SSD , pp. 94-111
    • Shekhar, S.1    Fetterer, A.2    Goyal, B.3
  • 25
    • 84937114316 scopus 로고    scopus 로고
    • Indexing relational database content offline for efficient keyword-based search
    • Qi Su and Jennifer Widom. Indexing relational database content offline for efficient keyword-based search. In IDEAS, pages 297-306, 2005.
    • (2005) IDEAS , pp. 297-306
    • Su, Q.1    Widom, J.2


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