V-Trees - A Storage Method for Long Vector Data
Summary: Proposes V-trees, a storage/indexing method for long 2D point sequences with fast fragment access. Operates as a positional B-tree variant of R-trees, optimized for scale-aware fragment queries on long geographic objects like rivers and boundaries. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 242 | Generalized Search Trees for Database Systems (Extended Abstract) | 1995 | VLDB | 0.00031110894 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next