Filters








30,542 Hits in 5.0 sec

Fast graph query processing with a low-cost index

James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey Xu Yu
2010 The VLDB journal  
There are also significant overheads in both index construction and maintenance. In this paper, we design a graph querying system that achieves both fast indexing and efficient query processing.  ...  This paper studies the problem of processing supergraph queries, that is, given a database containing a set of graphs, find all the graphs in the database of which the query graph is a supergraph.  ...  IGquery has the following distinguished features: (1) low index construction cost and low index maintenance cost (suitable for dynamic databases); (2) fast query processing by the dual operations of direct  ... 
doi:10.1007/s00778-010-0212-8 fatcat:5mibvibf2jchpgpj63yx6fb6gq

Querying Large Graph Databases [chapter]

Yiping Ke, James Cheng, Jeffrey Xu Yu
2010 Lecture Notes in Computer Science  
Low indexing cost but query performance is bounded by that of using graph-features  On-demand graph-feature selection incurs extra query cost 4/3/2010 30 DASFAA 10 Tutorial Other Indexes using  ...  for answering FG-queries (i.e., queries that have the largest verification cost)  Limitations  FG-index may have a high index-probing cost if F is too big  Non-FG queries are still answered by the  ...  Candidate Generation  Candidate generation Derive a lower bound for the joint support in D q Generate candidates from D q by FG-mining with the above bound  Advantages Significant reduction in search  ... 
doi:10.1007/978-3-642-12098-5_57 fatcat:x4a5sd6aijfzxjyzp7lqgjw75y

SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search [article]

Qi Chen, Bing Zhao, Haidong Wang, Mingqin Li, Chuanjie Liu, Zengzhong Li, Mao Yang, Jingdong Wang
2021 arXiv   pre-print
In the search stage, we use a query-aware scheme to dynamically prune the access of unnecessary posting lists.  ...  In this paper, we present a simple but efficient memory-disk hybrid indexing and search system, named SPANN, that follows the inverted index methodology.  ...  Fast approximate nearest-neighbor search with k-nearest neighbor graph.  ... 
arXiv:2111.08566v1 fatcat:rlie6xcfk5b2bep4wzf2r7oqz4

High throughput indexing for large-scale semantic web data

Long Cheng, Spyros Kotoulas, Tomas E. Ward, Georgios Theodoropoulos
2015 Proceedings of the 30th Annual ACM Symposium on Applied Computing - SAC '15  
We adopt a hybrid structure to combine the loading speed of similarsize based methods with the execution speed of graph-based approaches, using dynamic data repartitioning over query workloads.  ...  Currently, several such systems have been proposed, however, their indexing methods meet performance bottlenecks either on data loading or querying when processing large amounts of data.  ...  In this work, we introduce a hybrid and dynamic distributed RDF indexing approach, which specially targets fast loading data and computing queries on large RDF data, with a focus on analytical queries.  ... 
doi:10.1145/2695664.2695920 dblp:conf/sac/ChengKWT15 fatcat:kwlebevfmfetxjnyuf5ze5xxdi

Fast and Concurrent RDF Queries with RDMA-Based Distributed Graph Exploration

Jiaxin Shi, Youyang Yao, Rong Chen, Haibo Chen, Feifei Li
2016 USENIX Symposium on Operating Systems Design and Implementation  
With massive queries over large and constantly growing RDF data, it is imperative that an RDF graph store should provide low latency and high throughput for concurrent query processing.  ...  We present Wukong 1 , a distributed graph-based RDF store that leverages RDMA-based graph exploration to provide highly concurrent and low-latency queries over large data sets.  ...  Conclusion This paper describes Wukong, a distributed in-memory RDF store that leverages RDMA-based graph exploration to support fast and concurrent SPARQL queries.  ... 
dblp:conf/osdi/ShiYCCL16 fatcat:iszwak734zag5klwqpviy3vyp4

Zero-resource spoken term detection using hierarchical graph-based similarity search

Kazuo Aoyama, Atsunori Ogawa, Takashi Hattori, Takaaki Hori, Atsushi Nakamura
2014 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
Instead of a degree-reduced k-nearest neighbor (k-DR) graph for GSS, a hierarchical k-DR graph, which is constructed based on a cluster structure in the corresponding k-DR graph, is used as an index for  ...  This paper presents fast zero-resource spoken term detection (STD) in a large-scale data set, by using a hierarchical graph-based similarity search method (HGSS).  ...  candidates for a query segment with any length, selecting an appropriate index from the candidates when a query is given, and performing graph search with a multi-start greedy search and a breadth-first  ... 
doi:10.1109/icassp.2014.6854976 dblp:conf/icassp/AoyamaOHHN14 fatcat:syzdpxzd3ncbdikykgqcm6rxhm

A two-tier index architecture for fast processing large RDF data over distributed memory

Long Cheng, Spyros Kotoulas, Tomas E. Ward, Georgios Theodoropoulos
2014 Proceedings of the 25th ACM conference on Hypertext and social media - HT '14  
Experimental results on a commodity cluster show that we can load large RDF data very quickly in memory while remaining within an interactive range for query processing with the secondary index.  ...  Our approach adopts a two-tier index architecture on each computation node: (1) a light-weight primary index, to keep loading times low, and (2) a dynamic, multi-level secondary index, calculated as a  ...  CONCLUSION In this work, we propose a dynamic two-tier index architecture designed for fast processing large RDF data over distributed memory.  ... 
doi:10.1145/2631775.2631789 dblp:conf/ht/ChengKWT14 fatcat:mszao7clszh25cljm2mr3oj3xy

MOBHRG: Fast k-nearest-neighbor search by overlap reduction of hyperspherical regions

Omar U. Florez, Xiaojun Qi, Alexander Ocsa
2009 2009 IEEE International Conference on Acoustics, Speech and Signal Processing  
We propose a minimum overlap based hyperspherical region graph indexing structure to achieve fast similaritybased queries for both low and high dimensional datasets.  ...  Our extensive experimental results show the effectiveness of the proposed indexing structure compared with other tree and graph based indexing structures.  ...  A large leads to a high cost edge update and a small leads to a more cost effective edge update with suboptimal graph structures.  ... 
doi:10.1109/icassp.2009.4959788 dblp:conf/icassp/FlorezQO09 fatcat:xyubd4devzebxat4urgfx57mqe

iGraph

Wook-Shin Han, Jinsoo Lee, Minh-Duc Pham, Jeffrey Xu Yu
2010 Proceedings of the VLDB Endowment  
Given a query graph Q, the subgraph isomorphism problem is to find a set of graphs containing Q from a graph database, which is NP-complete.  ...  By using a graph index as a filter, we prune graphs that are not real answers at an inexpensive cost. Then, we need to use expensive subgraph isomorphism tests to verify filtered candidates only.  ...  of candidates and low disk I/O costs.  ... 
doi:10.14778/1920841.1920901 fatcat:nwpo24ygonfj5n54gpuumkvlza

RIQ: Fast processing of SPARQL queries on RDF quadruples

Anas Katib, Vasil Slavov, Praveen Rao
2016 Journal of Web Semantics  
We propose a new approach called RIQ that employs a decrease-and-conquer strategy for fast SPARQL query processing.  ...  In this paper, we address the problem of fast processing of SPARQL queries on a large RDF dataset, where the RDF statements are quadruples (or quads).  ...  This shows that the PV-Index index is indeed compact, which can facilitate fast pruning of the groups of similar graphs during query processing.  ... 
doi:10.1016/j.websem.2016.03.005 fatcat:amjgd5aobnh45hswyu2j4wx5x4

RIQ: Fast Processing of SPARQL Queries on RDF Quadruples

Anas Katib, Vasil Slavov, Praveen Rao
2016 Social Science Research Network  
We propose a new approach called RIQ that employs a decrease-and-conquer strategy for fast SPARQL query processing.  ...  In this paper, we address the problem of fast processing of SPARQL queries on a large RDF dataset, where the RDF statements are quadruples (or quads).  ...  This shows that the PV-Index index is indeed compact, which can facilitate fast pruning of the groups of similar graphs during query processing.  ... 
doi:10.2139/ssrn.3199230 fatcat:mfpm7kqks5d3pkenxflexrsdue

Fast in-memory SQL analytics on typed graphs

Chunbin Lin, Benjamin Mandel, Yannis Papakonstantinou, Matthias Springer
2016 Proceedings of the VLDB Endowment  
We study a class of graph analytics SQL queries, which we call relationship queries.  ...  These queries involving aggregation, join, semijoin, intersection and selection are a wide superset of fixedlength graph reachability queries and of tree pattern queries.  ...  GQ-Fast meets the performance of low-level graph engines while supporting a high-level programming interface.  ... 
doi:10.14778/3021924.3021941 fatcat:dagivjvudra2boxjor4oik3qfi

SparkRDF: Elastic Discreted RDF Graph Processing Engine With Distributed Memory

Xi Chen, Huajun Chen, Ningyu Zhang, Songyang Zhang
2015 2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)  
In this paper, we introduce the SparkRDF, an elastic discreted semantic graph processing engine with distributed memory.  ...  To reduce the high I/O and communication costs for distributed platforms, SparkRDF implements SPARQL query based on Spark, a novel in-memory distributed computing framework.  ...  In this paper, we introduce SparkRDF, an elastic discreted RDF graph processing system with distributed memory.  ... 
doi:10.1109/wi-iat.2015.186 dblp:conf/webi/ChenCZZ15 fatcat:zgje652vt5f3ria4f7m3bdxzbi

Towards application-specific query processing systems [article]

Dimitrios Vasilas
2020 arXiv   pre-print
We propose a distributed abstraction called Query Processing Unit that encapsulates primitive query processing tasks, and show how it can be used as a building block for assembling query systems.  ...  Database systems use query processing subsystems for enabling efficient query-based data retrieval.  ...  In the context of geo-distribution, the objectives of fast query response, consistent results, and low operational cost are inherently conflicting and create trade-offs. Query response time.  ... 
arXiv:2009.09671v1 fatcat:3liema5skbeh7n5zhog3iudwv4

A Demand-Driven Bulk Loading Scheme for Large-Scale Social Graphs [chapter]

Weiping Qu, Stefan Dessloch
2014 Lecture Notes in Computer Science  
Migrating large-scale data sets (e.g. social graphs) from cluster to cluster and meanwhile providing high system uptime is a challenge task. It requires fast bulk import speed.  ...  We address this problem by introducing our "Demand-driven Bulk Loading" scheme based on the data/query distributions tracked from Facebook's social graphs.  ...  In [12] , Goetz Graefe proposed his idea of fast loads and online B-tree index optimization as a side-effect of query processing.  ... 
doi:10.1007/978-3-319-10933-6_11 fatcat:xjvtuy5zyza2vplgsypjth54wy
« Previous Showing results 1 — 15 out of 30,542 results