Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2019
Probabilistic Databases with an Infinite Open-World Assumption
PODS '19: Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsPages 17–31https://doi.org/10.1145/3294052.3319681Probabilistic databases (PDBs) introduce uncertainty into relational databases by specifying probabilities for several possible instances. Traditionally, they are finite probability spaces over database instances. Such finite PDBs inherently make a ...
- research-articleOctober 2017
Designing a Query Language for RDF: Marrying Open and Closed Worlds
ACM Transactions on Database Systems (TODS), Volume 42, Issue 4Article No.: 21, Pages 1–46https://doi.org/10.1145/3129247When querying an Resource Description Framework (RDF) graph, a prominent feature is the possibility of extending the answer to a query with optional information. However, the definition of this feature in SPARQL—the standard RDF query language—has ...
- research-articleJune 2016
Estimating the Impact of Unknown Unknowns on Aggregate Query Results
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataPages 861–876https://doi.org/10.1145/2882903.2882909It is common practice for data scientists to acquire and integrate disparate data sources to achieve higher quality results. But even with a perfectly cleaned and merged data set, two fundamental questions remain: (1) is the integrated data set complete ...
- research-articleOctober 2015
Dynamically Time-Capped Possibilistic Testing of SubClassOf Axioms Against RDF Data to Enrich Schemas
K-CAP '15: Proceedings of the 8th International Conference on Knowledge CaptureArticle No.: 7, Pages 1–8https://doi.org/10.1145/2815833.2815835Axiom scoring is a critical task both for the automatic enrichment/learning and for the automatic validation of knowledge bases and ontologies. We designed and developed an axiom scoring heuristic based on possibility theory, which aims at overcoming ...
- research-articleJune 2010
Empirical assessment of C++-like implementations for multiple inheritance
ICOOOLPS '10: Proceedings of the Workshop on the Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and SystemsArticle No.: 2, Pages 1–5https://doi.org/10.1145/1925801.1925803Multiple inheritance and dynamic loading increase the overhead yielded by object-oriented mechanisms like late binding. This article provides an empirical assessment of the implementation technique that can be used in this context, namely C++-like ...
- research-articleJune 2010
Towards a full multiple-inheritance virtual machine
ICOOOLPS '10: Proceedings of the Workshop on the Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and SystemsArticle No.: 1, Pages 1–6https://doi.org/10.1145/1925801.1925802Late binding and subtyping create run-time overhead for object-oriented languages, especially in the context of both multiple inheritance and dynamic loading, for instance for Java interfaces. It is, however, generally agreed that the efficiency of Java ...
- research-articleOctober 2009
Empirical assessment of object-oriented implementations with multiple inheritance and static typing
OOPSLA '09: Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applicationsPages 41–60https://doi.org/10.1145/1640089.1640093Object-oriented languages involve a threefold tradeoff between runtime efficiency, expressiveness (multiple inheritance), and modularity, i.e. open-world assumption (OWA). Runtime efficiency is conditioned by both the implementation technique and ...
Also Published in:
ACM SIGPLAN Notices: Volume 44 Issue 10