Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Relational Information Systems
Relational Information Systems
Heuristic search in database systems
Proceedings from the first international workshop on Expert database systems
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A performance analysis of view materialization strategies
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Hybrid transitive closure algorithms
Proceedings of the sixteenth international conference on Very large databases
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
Handbook of AI
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Query processing strategies in the PASCAL/R relational database management system
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries
Proceedings of the Third International Conference on Data Engineering
Aggregative Closure: An Extension of Transitive Closure
Proceedings of the Fifth International Conference on Data Engineering
On the Computation of the Transitive Closure of Relational Operators
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Direct Algorithms for Computing the Transitive Closure of Database Relations
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Materialization and Incremental Update of Path Information
Proceedings of the Fifth International Conference on Data Engineering
New features for a relational database system to support computer aided design
New features for a relational database system to support computer aided design
Dijkstra's algorithm on-line: an empirical case study from public railroad transport
Journal of Experimental Algorithmics (JEA)
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations
IEEE Transactions on Knowledge and Data Engineering
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
A Linear-Order Based Access Method for Efficient Network Computations
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Using Multi-level Graphs for Timetable Information in Railway Systems
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Clustering objects on a spatial network
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Optimization and evaluation of shortest path queries
The VLDB Journal — The International Journal on Very Large Data Bases
A fast unified optimal route query evaluation algorithm
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Dex: high-performance exploration on large graphs for information retrieval
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Survey of graph database models
ACM Computing Surveys (CSUR)
BIBEX: a bibliographic exploration tool based on the DEX graph query engine
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
On-line exact shortest distance query processing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficiently indexing shortest paths by exploiting symmetry in graphs
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
On A☆ search with stopover areas
International Journal of Geographical Information Science
Virtual social networks online and mobile systems
Mobile Information Systems
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Querying RDF data from a graph database perspective
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
A highway-centric labeling approach for answering distance queries on large sparse graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Computer Science Review
| Hi-index | 0.01 |
Given a large graph, stored on disk, there is often a need to perform a search over this graph. Such a need could arise, for example, in the search component of a data-intensive expert system or to solve path problems in deductive database systems. In this paper, we present a novel data structuring technique and show how a branch-and-bound search algorithm can use this data structuring to prune the search space. Simulation results confirm that, using these techniques, a search can be expedited significantly without incurring a large storage penalty. As a side benefit, it is possible to organize the search to obtain successive approximations to the desired solution with considerable reduction in the total search.