Efficient processing of all neighboring object group queries with budget range constraint in road networks (Q6556324)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7866060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient processing of all neighboring object group queries with budget range constraint in road networks |
scientific article; zbMATH DE number 7866060 |
Statements
Efficient processing of all neighboring object group queries with budget range constraint in road networks (English)
0 references
17 June 2024
0 references
location-based queries
0 references
budget range-based all-neighboring-object group query
0 references
road networks
0 references
grid index
0 references
BR-ANOGQ algorithm
0 references
0.7612579464912415
0 references
0.7264865040779114
0 references
0.7114814519882202
0 references
0.7053094506263733
0 references
0.6983810663223267
0 references
