Tight Fine-Grained Bounds for Direct Access on Join Queries
We consider the task of lexicographic direct access to query answers. That is, we want to simulate an array containing the answers of a join query sorted in a lexicographic order chosen by the user. A recent dichotomy showed for which queries and orders ...
Marrying Top-k with Skyline Queries: Operators with Relaxed Preference Input and Controllable Output Size
The two paradigms to identify records of preference in a multi-objective setting rely either on dominance (e.g., the skyline operator) or on a utility function defined over the records’ attributes (typically using a top-k query). Despite their ...
A Caching-based Framework for Scalable Temporal Graph Neural Network Training
Representation learning over dynamic graphs is critical for many real-world applications such as social network services and recommender systems. Temporal graph neural networks (T-GNNs) are powerful representation learning methods and have demonstrated ...
