Accurate sampling-based cardinality estimation for complex graph queries
Accurately estimating the cardinality (i.e., the number of answers) of complex queries plays a central role in database systems. This problem is particularly difficult in graph databases, where queries often involve a large number of joins and self-joins. Recently, Park et al. [54] surveyed seven st...
| 主要な著者: | , |
|---|---|
| フォーマット: | Journal article |
| 言語: | English |
| 出版事項: |
Association for Computing Machinery
2024
|