Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Approximating Terminological Queries
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
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
Introduction to Evolutionary Computing
Introduction to Evolutionary Computing
Optimized Index Structures for Querying RDF from the Web
LA-WEB '05 Proceedings of the Third Latin American Web Congress
SwetoDblp ontology of Computer Science publications
Web Semantics: Science, Services and Agents on the World Wide Web
Scalable semantic web data management using vertical partitioning
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Minimal Deductive Systems for RDF
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
An Evolutionary Perspective on Approximate RDF Query Answering
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
LUBM: A benchmark for OWL knowledge base systems
Web Semantics: Science, Services and Agents on the World Wide Web
The fundamentals of iSPARQL: a virtual triple approach for similarity-based semantic web tasks
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
RDFBroker: a signature-based high-performance RDF store
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Benchmarking RDF production tools
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Towards Lightweight and Robust Large Scale Emergent Knowledge Processing
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Parallel Materialization of the Finite RDFS Closure for Hundreds of Millions of Triples
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Invited paper: Scalable reduction of large datasets to interesting subsets
Web Semantics: Science, Services and Agents on the World Wide Web
Biomedical publication knowledge acquisition, processing and dissemination with CORAAL
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems: Part II
TripleCloud: An Infrastructure for Exploratory Querying over Web-Scale RDF Data
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
Semantic Web search based on ontological conjunctive queries
Web Semantics: Science, Services and Agents on the World Wide Web
Discrete particle swarm optimisation for ontology alignment
Information Sciences: an International Journal
Predicting RDF triples in incomplete knowledge bases with tensor factorization
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Toward a data scalable solution for facilitating discovery of scientific data resources
DISCS-2013 Proceedings of the 2013 International Workshop on Data-Intensive Scalable Computing Systems
Editorial: Querying linked data graphs using semantic relatedness: A vocabulary independent approach
Data & Knowledge Engineering
| Hi-index | 0.00 |
We present a technique for answering queries over RDF data through an evolutionary search algorithm, using fingerprinting and Bloom filters for rapid approximate evaluation of generated solutions. Our evolutionary approach has several advantages compared to traditional database-style query answering. First, the result quality increases monotonically and converges with each evolution, offering "anytime" behaviour with arbitrary trade-off between computation time and query results; in addition, the level of approximation can be tuned by varying the size of the Bloom filters. Secondly, through Bloom filter compression we can fit large graphs in main memory, reducing the need for disk I/O during query evaluation. Finally, since the individuals evolve independently, parallel execution is straightforward. We present our prototype that evaluates basic SPARQL queries over arbitrary RDF graphs and show initial results over large datasets.