Sciweavers

707 search results - page 37 / 142
» Processing queries on tree-structured data efficiently
Sort
View
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
14 years 10 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...
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 8 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
ICDE
2005
IEEE
160views Database» more  ICDE 2005»
14 years 2 months ago
NXS: Native XML processing in Sybase RDBMS
Sybase's flagship database product, Adaptive Server Enterprise provides Native XML processing (NXS) support. In this paper we present our experience related to query processi...
Anupam Singh, Srikanth Sampath, Vadiraja Bhatt, Fr...
RCIS
2010
13 years 7 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
CIKM
2009
Springer
14 years 17 days ago
Efficient itemset generator discovery over a stream sliding window
Mining generator patterns has raised great research interest in recent years. The main purpose of mining itemset generators is that they can form equivalence classes together with...
Chuancong Gao, Jianyong Wang