메뉴 건너뛰기




Volumn 1, Issue 2, 2008, Pages 1404-1407

Periscope/GQ: A graph querying toolkit

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; OPTICAL INSTRUMENTS; SOCIAL NETWORKING (ONLINE);

EID: 84859252157     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1454159.1454184     Document Type: Article
Times cited : (6)

References (13)
  • 1
    • 0038208166 scopus 로고    scopus 로고
    • The many faces of process interaction graphs: A data management perspective
    • A. Gupta and B. Ludäscher. The many faces of process interaction graphs: A data management perspective. OMICS, 7(1):105-108, 2003.
    • (2003) OMICS , vol.7 , Issue.1 , pp. 105-108
    • Gupta, A.1    Ludäscher, B.2
  • 2
    • 0002718361 scopus 로고
    • Graphdb: Modeling and querying graphs in databases
    • R. H. Guting. Graphdb: Modeling and querying graphs in databases. In VLDB, 1994.
    • (1994) VLDB
    • Guting, R.H.1
  • 3
    • 33750010730 scopus 로고    scopus 로고
    • Efficient RDF storage and retrieval in Jena2
    • Techniqual Report: HPL-2003-266
    • K. Wilkinson et al. Efficient RDF storage and retrieval in Jena2. Techniqual Report: HPL-2003-266, 2003.
    • (2003)
    • Wilkinson, K.1
  • 4
    • 33745582166 scopus 로고    scopus 로고
    • DBLP Bibliography
    • M. Ley. DBLP Bibliography. http://www.informatik.uni-trier.de/~ley/db/.
    • Ley, M.1
  • 5
    • 33645151090 scopus 로고    scopus 로고
    • Pathsys: Integrating molecular interaction graphs for systems biology
    • M. Baitaluk et al. Pathsys: Integrating molecular interaction graphs for systems biology. BMC Bioinformatics, 7(55), 2006.
    • (2006) BMC Bioinformatics , vol.7 , Issue.55
    • Baitaluk, M.1
  • 6
    • 0345863935 scopus 로고    scopus 로고
    • The kegg resources for deciphering the genome
    • M. Kanehisa et al. The kegg resources for deciphering the genome. Nucleic Acids Res., 32:D277-D280, 2004.
    • (2004) Nucleic Acids Res. , vol.32
    • Kanehisa, M.1
  • 7
    • 0036040082 scopus 로고    scopus 로고
    • Algorithmics and applications of tree and graph searching
    • D. Shasha, J. T.-L. Wang, and R. Giugno. Algorithmics and applications of tree and graph searching. In PODS, 2002.
    • (2002) PODS
    • Shasha, D.1    Wang, J.T-L.2    Giugno, R.3
  • 8
    • 0032625751 scopus 로고    scopus 로고
    • A graph query language and its query processing
    • L. Sheng, Z. M. Ozsoyoglu, and G. Ozsoyoglu. A graph query language and its query processing. In ICDE, 1999.
    • (1999) ICDE
    • Sheng, L.1    Ozsoyoglu, Z.M.2    Ozsoyoglu, G.3
  • 9
    • 57149123533 scopus 로고    scopus 로고
    • Efficient aggregation for graph summarization
    • Y. Tian, R. A. Hankins, and J. M. Patel. Efficient aggregation for graph summarization. In SIGMOD, 2008.
    • (2008) SIGMOD
    • Tian, Y.1    Hankins, R.A.2    Patel, J.M.3
  • 10
    • 52649126146 scopus 로고    scopus 로고
    • TALE: a tool for approximate large graph matching
    • Y. Tian and J. M. Patel. TALE: a tool for approximate large graph matching. In ICDE, 2008.
    • (2008) ICDE
    • Tian, Y.1    Patel, J.M.2
  • 11
    • 33846662155 scopus 로고    scopus 로고
    • SAGA: a subgraph matching tool for biological graphs
    • Y. Tian et al. SAGA: a subgraph matching tool for biological graphs. Bioinformatics, 23(2):232-239, 2007.
    • (2007) Bioinformatics , vol.23 , Issue.2 , pp. 232-239
    • Tian, Y.1
  • 12
    • 3142736597 scopus 로고    scopus 로고
    • Graph indexing: a frequent structure-based approach
    • X. Yan, P. S. Yu, and J. Han. Graph indexing: a frequent structure-based approach. In SIGMOD, 2004.
    • (2004) SIGMOD
    • Yan, X.1    Yu, P.S.2    Han, J.3
  • 13
    • 29844431949 scopus 로고    scopus 로고
    • Substructure similarity search in graph databases
    • X. Yan, P. S. Yu, and J. Han. Substructure similarity search in graph databases. In SIGMOD, 2005.
    • (2005) SIGMOD
    • Yan, X.1    Yu, P.S.2    Han, J.3


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