Analysis of multilevel graph partitioning
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Maintaining hierarchical graph views
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On external memory graph traversal
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Finding shortest paths in large network systems
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Query Relaxation by Structure and Semantics for Retrieval of Logical Web Documents
IEEE Transactions on Knowledge and Data Engineering
Materialization Trade-Offs in Hierarchical Shortest Path Algorithms
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
XRANK: ranked keyword search over XML documents
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
SPIN: searching personal information networks
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Bidirectional expansion for keyword search on graph databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
The SphereSearch engine for unified ranked retrieval of heterogeneous XML and web documents
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Indexing Relational Database Content Offline for Efficient Keyword-Based Search
IDEAS '05 Proceedings of the 9th International Database Engineering & Application Symposium
Effective keyword search in relational databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Spark: top-k keyword query in relational databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
BLINKS: ranked keyword searches on graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Discover: keyword search in relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient IR-style keyword search over relational databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Objectrank: authority-based keyword search in databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient out-of-core algorithms for linear relaxation using blocking covers
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Keyword search in databases: the power of RDBMS
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Keyword search on structured and semi-structured data
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Fast nearest-neighbor search in disk-resident graphs
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast query execution for retrieval models based on path-constrained random walks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
A framework for evaluating database keyword search strategies
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Ten thousand SQLs: parallel keyword queries computing
Proceedings of the VLDB Endowment
Scalable keyword search on large data streams
The VLDB Journal — The International Journal on Very Large Data Bases
Providing built-in keyword search capabilities in RDBMS
The VLDB Journal — The International Journal on Very Large Data Bases
Local graph sparsification for scalable clustering
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Index design and query processing for graph conductance search
The VLDB Journal — The International Journal on Very Large Data Bases
Processing keyword search on XML: a survey
World Wide Web
Finding information nebula over large networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Learning to rank results in relational keyword search
Proceedings of the 20th ACM international conference on Information and knowledge management
Efficient association discovery with keyword-based constraints on large graph data
Proceedings of the 20th ACM international conference on Information and knowledge management
Organizational search in email systems
Proceedings of the 50th Annual Southeast Regional Conference
Top-k spatial keyword queries on road networks
Proceedings of the 15th International Conference on Extending Database Technology
Ranking structural parameters for social networks
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
Information-complete and redundancy-free keyword search over large data graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
Search and result presentation in scientific workflow repositories
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Efficient Top-k Keyword Search Over Multidimensional Databases
International Journal of Data Warehousing and Mining
Large-scale spectral clustering on graphs
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combine relational, XML and HTML data. Responses to keyword queries are usually modeled as trees that connect nodes matching the keywords. In this paper we address the problem of keyword search on graphs that may be significantly larger than memory. We propose a graph representation technique that combines a condensed version of the graph (the "supernode graph") which is always memory resident, along with whatever parts of the detailed graph are in a cache, to form a multi-granular graph representation. We propose two alternative approaches which extend existing search algorithms to exploit multigranular graphs; both approaches attempt to minimize IO by directing search towards areas of the graph that are likely to give good results. We compare our algorithms with a virtual memory approach on several real data sets. Our experimental results show significant benefits in terms of reduction in IO due to our algorithms.