|
- Efficient Exact Subgraph Matching via GNN-based Path Dominance . . . - VLDB
In this paper, we focus on exact subgraph matching queries over a large-scale data graph, and present a novel GNN-based path embedding (GNN-PE) framework for exact and eficient subgraph matching
- EXACT: an extensible approach to active object-oriented databases - VLDB
This paper presents EXACT, an EXtensible approach to ACTive OO DBMSs, which allows the user to choose the execution model that best fits the semantics of the concept to be supported
- CIDR Proceedings - mail. vldb. org
Our preliminary evaluation across various data systems and workloads demonstrates that B-AQP accelerates query execution by up to 185× compared to uniform sampling and four orders of magnitude compared to exact queries, all with guaranteed errors
- Discovery of Approximate (and Exact) Denial Constraints
This section describes how DCFINDER uses the evidence set to discover minimal approximate (and exact) DCs It also describes three measures to score the interestingness of the discovered DCs
- Exact Cardinality Query Optimization for Optimizer Testing
In this paper, we study the exact cardinality query optimization problem, i e optimizing the query using the exact cardinality for each relevant expression A relevant expression is one whose cardinality is required during optimization
- Effective Indexing for Approximate Constrained Shortest Path . . . - VLDB
Because exact CSP is NP-hard, previous work mostly focuses on approximate solutions Even so, existing methods are still pro-hibitively expensive for large road networks
- An Efficient Partition Based Method for Exact Set Similarity Join
pose a partition-based framework for the exact set similarity join We develop a partition scheme to partition the sets into several dis oint subsets a mmon subset We group the sets with same si e to share computation We build inverte
- F VWDU S GLDPRQG Efficient Algorithms for Densest Subgraph Discove
4 3 Limitations of Existing Algorithms while PeelApp is faster than Exact, it also sacrifices some accuracy For example, when is an edge, Exact finds the exact EDS in O((mn + m3)log n) time, while PeelApp retu ns a subgraph with 0 5-approximation i e , O(m) Both solutions can be ineff (d) the flow network
|
|
|