K-NEAREST NEIGHBORS SEARCH IMPLEMENTATION ON TIME AGGREGATED GRAPH IN GRAPH DATABASE
In real world problems, the data contained in a graph data structure is not always constant, the data can change over time. One of graph modeling which can model time dependent graph is time aggregated graph. Time aggregated graph can answer queries such as searching for knearest neighbors. K-neares...
Saved in:
Main Author: | Legawa Halqavi, Prama |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/42404 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
Aggregate Nearest Neighbor Queries in Spatial Databases
by: PAPADIAS, Dimitris, et al.
Published: (2005) -
On efficiently finding reverse K-nearest neighbors over uncertain graphs
by: GAO, Yunjun, et al.
Published: (2017) -
Search K-Nearest Neighbors On Air
by: ZHENG, Baihua, et al.
Published: (2003) -
Efficient approximate nearest neighbor search on high-dimensional vectors by graph and quantization
by: Gou, Yutong
Published: (2024) -
Processing Incomplete k Nearest Neighbor Search
by: MIAO, Xiaoye, et al.
Published: (2016)