A Unified Approach to Path Problems
Journal of the ACM (JACM)
Fast Algorithms for Solving Path Problems
Journal of the ACM (JACM)
RQL: a declarative query language for RDF
Proceedings of the 11th international conference on World Wide Web
Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Ρ-Queries: enabling querying for semantic associations on the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
LA-WEB '03 Proceedings of the First Conference on Latin American Web Congress
RAL: An Algebra for Querying RDF
World Wide Web
Jena: implementing the semantic web recommendations
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Optimized Index Structures for Querying RDF from the Web
LA-WEB '05 Proceedings of the Third Latin American Web Congress
Searching the Semantic Web: Approximate Query Processing Based on Ontologies
IEEE Intelligent Systems
BioPatentMiner: an information retrieval system for biomedical patents
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
BRAHMS: a workbench RDF store and high performance memory system for semantic association discovery
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Semantics and complexity of SPARQL
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Querying the semantic web with preferences
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Querying RDF data from a graph database perspective
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Relationship web: realizing the Memex vision with the help of semantic web
Workshop on multimedia information retrieval on The many faces of multimedia semantics
ACM Transactions on the Web (TWEB)
NAGA: harvesting, searching and ranking knowledge
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
An Extension of SPARQL for RDFS
Semantic Web, Ontologies and Databases
ICCS '08 Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning
RDF-3X: a RISC-style engine for RDF
Proceedings of the VLDB Endowment
nSPARQL: A Navigational Language for RDF
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Database and information-retrieval methods for knowledge discovery
Communications of the ACM - A Direct Path to Dependable Software
Extending SPARQL with regular expression patterns (for querying RDF)
Web Semantics: Science, Services and Agents on the World Wide Web
Semantics preserving SPARQL-to-SQL translation
Data & Knowledge Engineering
Functions over RDF Language Elements
ISWC '09 Proceedings of the 8th International Semantic Web Conference
SPARQL Query Re-writing Using Partonomy Based Transformation Rules
GeoS '09 Proceedings of the 3rd International Conference on GeoSpatial Semantics
The RDF-3X engine for scalable management of RDF data
The VLDB Journal — The International Journal on Very Large Data Bases
Discovering semantic similarity association in semantic search system
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
From information to knowledge: harvesting entities and relationships from web sources
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
RDFProv: A relational RDF store for querying and managing scientific workflow provenance
Data & Knowledge Engineering
Ranking entities similar to an entity for a given relationship
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
nSPARQL: A navigational language for RDF
Web Semantics: Science, Services and Agents on the World Wide Web
Relationalization of provenance data in complex RDF reification nodes
Electronic Commerce Research
R2DF framework for ranked path queries over weighted RDF graphs
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Efficient association discovery with keyword-based constraints on large graph data
Proceedings of the 20th ACM international conference on Information and knowledge management
Conkar: constraint keyword-based association discovery
Proceedings of the 20th ACM international conference on Information and knowledge management
Chapter 3: search for knowledge
Search Computing
Regular path queries on large graphs
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Expressive Languages for Path Queries over Graph-Structured Data
ACM Transactions on Database Systems (TODS)
Querying Semantic Data on the Web?
ACM SIGMOD Record
A graph-based recovery and decomposition of Swanson's hypothesis using semantic predications
Journal of Biomedical Informatics
Proceedings of the 32nd symposium on Principles of database systems
Proceedings of the 22nd international conference on World Wide Web
Hybrid query execution engine for large attributed graphs
Information Systems
Hi-index | 0.00 |
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical to want to query about interactions between proteins. The aim of such queries is to "extract" relationships between entities i.e. paths from a data graph. Often, such queries will specify certain constraints that qualifying results must satisfy e.g. paths involving a set of mandatory nodes. Unfortunately, most present day Semantic Web query languages including the current draft of the anticipated recommendation SPARQL, lack the ability to express queries about arbitrary path structures in data. In addition, many systems that support some limited form of path queries rely on main memory graph algorithms limiting their applicability to very large scale graphs. In this paper, we present an approach for supporting Path Extraction queries. Our proposal comprises (i) a query language SPARQ2L which extends SPARQL with path variables and path variable constraint expressions, and (ii) a novel query evaluation framework based on efficient algebraic techniques for solving path problems which allows for path queries to be efficiently evaluated on disk resident RDF graphs. The effectiveness of our proposal is demonstrated by a performance evaluation of our approach on both real world based and synthetic dataset.