On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs.

Lisa Hellerstein Philip N. Klein Robert Wilber

Published in: Inf. Process. Lett. (1990)

Keyphrases

reachability queries
space complexity
data objects
main memory
massive graphs
labeling scheme
structured databases
worst case
space requirements
arc consistency
worst case time complexity
upper bound
databases
multi dimensional
relational databases
xml query processing
data structure