Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
In-memory hash tables for accumulating text vocabularies
Information Processing Letters
Conditions for the convergence of evolutionary algorithms
Journal of Systems Architecture: the EUROMICRO Journal - Special issue on evolutionary computing
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Database Architecture Optimized for the New Bottleneck: Memory Access
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
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
Adaptive Penalties for Evolutionary Graph Coloring
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
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
Minimal Deductive Systems for RDF
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
Towards LarKC: A Platform for Web-Scale Reasoning
ICSC '08 Proceedings of the 2008 IEEE International Conference on Semantic Computing
Sindice.com: a document-oriented lookup index for open linked data
International Journal of Metadata, Semantics and Ontologies
Relaxing RDF queries based on user and domain preferences
Journal of Intelligent Information Systems
YARS2: a federated repository for querying graph structured data from the web
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Journal on data semantics X
General lower bounds for evolutionary algorithms
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Characterizing the semantic web on the web
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Anytime Query Answering in RDF through Evolutionary Algorithms
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Hi-index | 0.00 |
RDF is increasingly being used to represent large amounts of data on the Web. Current query evaluation strategies for RDF are inspired by databases, assuming perfect answers on finite repositories. In this paper, we focus on a query method based on evolutionary computing, which allows us to handle uncertainty, incompleteness and unsatisfiability, and deal with large datasets, all within a single conceptual framework. Our technique supports approximate answers with "anytime" behaviour. We present scalability results and next steps for improvement.