Object Graph Programming
Abstract
References
Recommendations
Efficient algorithms for supergraph query processing on graph databases
We study the problem of processing supergraph queries on graph databases. A graph database D is a large set of graphs. A supergraph query q on D is to retrieve all the graphs in D such that q is a supergraph of them. The large ...
TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database
PACMMODWith an exponentially growing number of graphs from disparate repositories, there is a strong need to analyze a graph database containing an extensive collection of small- or medium-sized data graphs (e.g., chemical compounds). Although subgraph ...
Improving Semantic Queries by Utilizing UNL Ontology and a Graph Database
ICSC '12: Proceedings of the 2012 IEEE Sixth International Conference on Semantic ComputingThis paper describes an approach for improving semantic queries by utilizing Universal Words (UWs) and a graph database. Concept Description Language (CDL) is used for representing the semantic data, and Neo4j graph database is used as the storage back-...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
- Co-chairs:
- Ana Paiva,
- Rui Abreu,
- Program Co-chairs:
- Abhik Roychoudhury,
- Margaret Storey
Sponsors
In-Cooperation
- Faculty of Engineering of University of Porto
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- US National Science Fund
Conference
Acceptance Rates
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 428Total Downloads
- Downloads (Last 12 months)428
- Downloads (Last 6 weeks)50
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in