Sciweavers

18 search results - page 2 / 4
» Efficient Graph Reachability Query Answering Using Tree Deco...
Sort
View
ICDT
2009
ACM
105views Database» more  ICDT 2009»
14 years 5 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
14 years 5 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
14 years 5 months ago
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao
ICDE
2009
IEEE
205views Database» more  ICDE 2009»
14 years 6 months ago
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
Thanh Tran, Haofen Wang, Sebastian Rudolph, Philip...
ICDE
2002
IEEE
163views Database» more  ICDE 2002»
14 years 6 months ago
Keyword Searching and Browsing in Databases using BANKS
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, So...