Efficient Relational Techniques for Processing Graph Queries

在线阅读 下载PDF 导出详情
摘要 Graphsarewidelyusedformodelingcomplicateddatasuchassocialnetworks,chemicalcompounds,proteininteractionsandsemanticweb.Toeffiectivelyunderstandandutilizeanycollectionofgraphs,agraphdatabasethatefficientlysupportselementaryqueryingmechanismsiscruciallyrequired.Forexample,SubgraphandSupergraphqueriesareimportanttypesofgraphquerieswhichhavemanyapplicationsinpractice.Aprimarychallengeincomputingtheanswersofgraphqueriesisthatpair-wisecomparisonsofgraphsareusuallyhardproblems.Relationaldatabasemanagementsystems(RDBMSs)haverepeatedlybeenshowntobeabletoefficientlyhostdifferenttypesofdatasuchascomplexobjectsandXMLdata.RDBMSsderivemuchoftheirperformancefromsophisticatedoptimizercomponentswhichmakeuseofphysicalpropertiesthatarespecifictotherelationalmodelsuchassortedness,properjoinorderingandpowerfulindexingmechanisms.Inthisarticle,westudytheproblemofindexingandqueryinggraphdatabasesusingtherelationalinfrastructure.Wepresentapurelyrelationalframeworkforprocessinggraphqueries.Thisframeworkreliesonbuildingalayerofgraphfeaturesknowledgewhichcapturemetadataandsummaryfeaturesoftheunderlyinggraphdatabase.Wedescribedifferentqueryingmechanismswhichmakeuseofthelayerofgraphfeaturesknowledgetoachievescalableperformanceforprocessinggraphqueries.Finally,weconductanextensivesetofexperimentsonrealandsyntheticdatasetstodemonstratetheefficiencyandthescalabilityofourtechniques.
机构地区 不详
出版日期 2010年06月16日(中国期刊网平台首次上网日期,不代表论文的发表时间)
  • 相关文献