Sciweavers

621 search results - page 32 / 125
» Efficient algorithms for minimizing tree pattern queries
Sort
View
ICDT
2005
ACM
130views Database» more  ICDT 2005»
14 years 1 months ago
Rewriting Queries Using Views with Access Patterns Under Integrity Constraints
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
Alin Deutsch, Bertram Ludäscher, Alan Nash
BDA
2001
13 years 9 months ago
Rewriting and Evaluating Tree Queries with XPath
A Community Web portal is a set of tools for a community of people who want to share information on a certain domain via the Web. The backbone of this system is an ontology which ...
Bernd Amann, Catriel Beeri, Irini Fundulaki, Miche...
CIKM
2007
Springer
14 years 2 months ago
Evaluation of partial path queries on xml data
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
Stefanos Souldatos, Xiaoying Wu, Dimitri Theodorat...
TKDE
2008
152views more  TKDE 2008»
13 years 8 months ago
SRDA: An Efficient Algorithm for Large-Scale Discriminant Analysis
Linear Discriminant Analysis (LDA) has been a popular method for extracting features that preserves class separability. The projection functions of LDA are commonly obtained by max...
Deng Cai, Xiaofei He, Jiawei Han
DKE
2008
96views more  DKE 2008»
13 years 8 months ago
Fragment-based approximate retrieval in highly heterogeneous XML collections
Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents ...
Ismael Sanz, Marco Mesiti, Giovanna Guerrini, Rafa...