Amanote Research
Register
Sign In
Scalable Indexing of RDF Graphs for Efficient Join Processing
doi 10.1145/1645953.1646159
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2009
Authors
George H.L. Fletcher
Peter W. Beck
Publisher
ACM Press
Related search
Efficient Subgraph Matching on Large RDF Graphs Using MapReduce
Data Science and Engineering
Computational Mechanics
Computer Science Applications
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
IEEE Transactions on Knowledge and Data Engineering
Computational Theory
Computer Science Applications
Information Systems
Mathematics
Map-Side Join Processing of SPARQL Queries Based on Abstract RDF Data Filtering
Journal of Database Management
Hardware
Information Systems
Architecture
Software
Efficient Dictionary Compression for Processing RDF Big Data Using Google BigQuery
SETS: Scalable and Efficient Tree Search in Dependency Graphs
Efficient Algorithm for Overlap-Join
Information Technology Journal
Effective Partitioning and Multiple RDF Indexing for Database Triple Store
Engineering Journal
Engineering
Controlling Access to RDF Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Scalable Peer-To-Peer-Based RDF Management
