Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries.
Peter DamaschkePublished in: Networks (2011)
Keyphrases
- query processing
- query language
- query evaluation
- efficient processing
- candidate set
- database queries
- database
- response time
- disk resident
- neighborhood graph
- web search engines
- range queries
- graph matching
- retrieval systems
- complex queries
- graph databases
- reachability queries
- data structure
- gaussian graphical models
- query logs
- graph data
- sparse data
- query formulation
- weighted graph
- user queries
- random walk
- high dimensional
- search engine