Search or ask a question
Pricing
Login
Sign up
Home
Notebook
BETA
Profile
Citation booster
Literature Review
Copilot
Citation generator
Paraphraser
AI Detector
Chrome Extension
Talk with us
Use on ChatGPT
All figures (17)
Figure 6: Labeled Compact Tree and Entry Edge Partition
Figure 14: Query Time of boundk Varying Keyword Frequency
Figure 12: Hit rate, Spearman’s rho and Error by Varying k
Figure 13: Query Time in Microseconds by Varying k
Figure 1: A Graph G with Keywords
Figure 8: Basic Pivot Approach
Figure 7: Constructing Candidate Lists
Table 2: Dataset Statistics
Table 1: Algorithm Complexities on Trees (T ) and Graphs (G)
Figure 11: Global Storage Example for graph-pivot
Figure 4: CT(λ), ECT(λ) and TVP(λ) for Keyword λ
Figure 3: A Tree T with Preorder and Interval on Each Node
Figure 2: Two Distance Oracles O1 and O2
Figure 10: Pivot Approach with Tree Balancing
Figure 9: Distance Preserving Balanced Tree
Figure 5: Shortest Path Trees T1 and T2
Figure 15: Index Time and Index Size
Journal Article
•
DOI
•
Top-K nearest keyword search on large graphs
[...]
Miao Qiao
1
,
Lu Qin
1
,
Hong Cheng
1
,
Jeffrey Xu Yu
1
,
Wentao Tian
1
- Show less
+1 more
•
Institutions (1)
The Chinese University of Hong Kong
1
01 Aug 2013
-