Fast Algorithms for Solving Path Problems
Journal of the ACM (JACM)
RQL: a declarative query language for RDF
Proceedings of the 11th international conference on World Wide Web
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Fast discovery of connection subgraphs
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Bidirectional expansion for keyword search on graph databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Exploratory search: from finding to understanding
Communications of the ACM - Supporting exploratory search
Center-piece subgraphs: problem definition and fast solutions
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
BLINKS: ranked keyword searches on graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Collaborative multi-paradigm exploratory search
Proceedings of the hypertext 2008 workshop on Collaboration and collective intelligence
Structure Discovery Queries in Disk-Based Semantic Web Databases
SKG '08 Proceedings of the 2008 Fourth International Conference on Semantics, Knowledge and Grid
Exploratory Search
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Context-Aware Object Connection Discovery in Large Graphs
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Q2Semantic: a lightweight keyword interface to semantic search
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Querying RDF data from a graph database perspective
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Query recommendation using query logs in search engines
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Discovery querying in linked open data
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Proceedings of the 22nd international conference on World Wide Web
Hi-index | 0.01 |
Data on the Web is increasingly being used for discovery and exploratory tasks. Unlike traditional fact-finding tasks that require only the typical single-query and response paradigm, these tasks involve a multistage search process in which bits of information are accumulated over a series of related queries. The ability and effectiveness of users to connect the dots between these pieces of information are crucial to enable discovery. In this paper, we introduce the notion of agglomerative querying for supporting "search processes" and present its motivation, challenges and formalization. We focus on a specific class of agglomerative querying called association agglomerative querying which is very natural for linked data models such as RDF. We present a preliminary implementation approach for processing such queries and discuss its relationship with SPARQL query processing. Finally, we present empirical results for proving the effectiveness of our approach on the DBLP dataset and future directions.