Sciweavers

85 search results - page 7 / 17
» Fast and practical indexing and querying of very large graph...
Sort
View
PVLDB
2010
129views more  PVLDB 2010»
14 years 8 months ago
iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...
Wook-Shin Han, Jinsoo Lee, Minh-Duc Pham, Jeffrey ...
ADC
2007
Springer
183views Database» more  ADC 2007»
15 years 1 months ago
Efficient Similarity Search by Summarization in Large Video Database
With the explosion of video data, video processing technologies have advanced quickly and been applied into many fields, such as advertisements, medical etc.. To fast search these...
Xiangmin Zhou, Xiaofang Zhou, Heng Tao Shen
BTW
2003
Springer
170views Database» more  BTW 2003»
15 years 2 months ago
Executing Nested Queries
Abstract: Optimization of nested queries, in particular finding equivalent “flattened” queries for queries that employ the SQL sub-query construct, has been researched extensiv...
Goetz Graefe
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
15 years 11 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
15 years 9 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...