[HTML][HTML] Coalition structure generation: A survey
The coalition structure generation problem is a natural abstraction of one of the most
important challenges in multi-agent systems: How can a number of agents divide …
important challenges in multi-agent systems: How can a number of agents divide …
The RDF-3X engine for scalable management of RDF data
RDF is a data model for schema-free structured information that is gaining momentum in the
context of Semantic-Web data, life sciences, and also Web 2.0 platforms. The “pay-as-you …
context of Semantic-Web data, life sciences, and also Web 2.0 platforms. The “pay-as-you …
RDF-3X: a RISC-style engine for RDF
RDF is a data representation format for schema-free structured information that is gaining
momentum in the context of Semantic-Web corpora, life sciences, and also Web 2.0 …
momentum in the context of Semantic-Web corpora, life sciences, and also Web 2.0 …
A survey on advancing the dbms query optimizer: Cardinality estimation, cost model, and plan enumeration
Query optimizer is at the heart of the database systems. Cost-based optimizer studied in this
paper is adopted in almost all current database systems. A cost-based optimizer introduces …
paper is adopted in almost all current database systems. A cost-based optimizer introduces …
Overlapping coalition formation in game theory: A state-of-the-art review
HA Mahdiraji, E Razghandi… - Expert Systems with …, 2021 - Elsevier
A coalition as a group of agents aims to work jointly to earn much more gains as a result of
their cooperation. Many existing studies assumed that members take advantage of joining …
their cooperation. Many existing studies assumed that members take advantage of joining …
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced
with very large graphs that contain hundreds of millions of RDF triples. This paper addresses …
with very large graphs that contain hundreds of millions of RDF triples. This paper addresses …
SPORES: sum-product optimization via relational equality saturation for large scale linear algebra
Machine learning algorithms are commonly specified in linear algebra (LA). LA expressions
can be rewritten into more efficient forms, by taking advantage of input properties such as …
can be rewritten into more efficient forms, by taking advantage of input properties such as …
Robust Join Processing with Diamond Hardened Joins
Join ordering and join processing has a huge impact on query execution and can easily
affect the query response time by orders of magnitude. In particular, when joins are …
affect the query response time by orders of magnitude. In particular, when joins are …
Quantifying TPC-H choke points and their optimizations
TPC-H continues to be the most widely used benchmark for relational OLAP systems. It
poses a number of challenges, also known as" choke points", which database systems have …
poses a number of challenges, also known as" choke points", which database systems have …
Ready to leap (by co-design)? join order optimisation on quantum hardware
M Schönberger, S Scherzinger… - Proceedings of the ACM on …, 2023 - dl.acm.org
The prospect of achieving computational speedups by exploiting quantum phenomena
makes the use of quantum processing units (QPUs) attractive for many algorithmic database …
makes the use of quantum processing units (QPUs) attractive for many algorithmic database …