Results 11 to 20 of about 10,613,951 (330)
Parallel Trajectory-to-Location Join [PDF]
The matching between trajectories and locations, called Trajectory-to-Location join (TL-Join), is fundamental functionality in spatiotemporal data management.
Shuo Shang +5 more
semanticscholar +3 more sources
Survey on Exact kNN Queries over High-Dimensional Data Space
k nearest neighbours (kNN) queries are fundamental in many applications, ranging from data mining, recommendation system and Internet of Things, to Industry 4.0 framework applications.
Nimish Ukey +5 more
doaj +2 more sources
Color hypergroup and join space obtained by the vertex coloring of a graph
In this paper, some new classes of hyperoperations, extracting from the vertex coloring of a graph, are presented. By these hyperoperations, we define a color hypergroup and a color join space on the vertex set of a graph.
M. Golmohamadian, M. M. Zahedi
semanticscholar +2 more sources
Auto-Join: Joining Tables by Leveraging Transformations
Traditional equi-join relies solely on string equality comparisons to perform joins. However, in scenarios such as ad-hoc data analysis in spreadsheets, users increasingly need to join tables whose join-columns are from the same semantic domain but use ...
Erkang Zhu, Ye-Ye He, S. Chaudhuri
semanticscholar +2 more sources
Detecting Logic Bugs of Join Optimizations in DBMS [PDF]
Generation-based testing techniques have shown their effectiveness in detecting logic bugs of DBMS, which are often caused by improper implementation of query optimizers.
Xiu Tang +4 more
semanticscholar +1 more source
A notational Design of Join Points [PDF]
Join points are the composition points where aspects are composed with the base system. In other words they are target hooks in the base system where aspect’s implementation is weaved in.
Iqbal, Saqib, Allen, Gary
core +4 more sources
WarpGate: A Semantic Join Discovery System for Cloud Data Warehouses [PDF]
Data discovery is a major challenge in enterprise data analysis: users often struggle to find data relevant to their analysis goals or even to navigate through data across data sources, each of which may easily contain thousands of tables.
Tian-Ji Cong +4 more
semanticscholar +1 more source
Efficient Massively Parallel Join Optimization for Large Queries [PDF]
Modern data analytical workloads often need to run queries over a large number of tables. An optimal query plan for such queries is crucial for being able to run these queries within acceptable time bounds.
Riccardo Mancini +4 more
semanticscholar +1 more source
On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms
We present a dynamic index structure for join sampling. Built for an (equi-) join Q --- let IN be the total number of tuples in the input relations of Q --- the structure uses ~O(IN) space, supports a tuple update of any relation in ~O(1) time, and ...
Shi-Yuan Deng, Shangqi Lu, Yufei Tao
semanticscholar +1 more source
Join Order Selection with Deep Reinforcement Learning: Fundamentals, Techniques, and Challenges
Join Order Selection (JOS) is a fundamental challenge in query optimization, as it significantly affects query performance. However, finding an optimal join order is an NP-hard problem due to the exponentially large search space. Despite the decades-long
Zhengtong Yan +2 more
semanticscholar +1 more source

