Feat-SKSJ

Amagata, Daichi; Tsuruoka, Shohei; Arai, Yusuke; Hara, Takahiro

doi:10.1145/3474717.3483629

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

2023

Publication Types

Select...

Article2

Other2

Book1

Relationship

Self Cite1

Independent4

Authors

Journals

Cited by 7 publications

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Efficient Retrieval of Top-k Weighted Spatial Triangles

Taniguchi

Amagata

Hara

2022

Database Systems for Advanced Applications

Self Cite

View full text Add to dashboard Cite

Due to the proliferation of location-based services and IoT devices, a lot of spatial points are being generated. Spatial data analysis is well known to be an important task. As spatial data analysis tools, graphs consisting of spatial points, where each point has edges to its nearby points and the weight of each edge is the distance between the corresponding points, have been receiving much attention. We focus on triangles (one of the simplest sub-graph patterns) in such graphs and address the problem of retrieving the top-k weighted spatial triangles. This problem has important real-life applications, e.g., group search, urban planning, and co-location pattern mining. However, this problem is computationally challenging, because the number of triangles in a graph is generally huge and enumerating all of them is not feasible. To solve this challenge, we propose an efficient algorithm that returns the exact result. Our experimental results on real datasets show the efficiency of our algorithm.

show abstract