Sciweavers

66 search results - page 5 / 14
» Conjunctive Query Containment over Trees
Sort
View
ICDE
2009
IEEE
182views Database» more  ICDE 2009»
14 years 9 months ago
Adaptive Parallelization of Queries over Dependent Web Service Calls
We have developed a system to process database queries over composed data providing web services. The queries are transformed into execution plans containing an operator that invok...
Manivasakan Sabesan, Tore Risch
IPL
2006
103views more  IPL 2006»
13 years 7 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen
BNCOD
2009
145views Database» more  BNCOD 2009»
13 years 8 months ago
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
Yuqing Wu, Dirk Van Gucht, Marc Gyssens, Jan Pared...
CLUSTER
2005
IEEE
14 years 1 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
JCSS
2008
73views more  JCSS 2008»
13 years 7 months ago
Structure identification of Boolean relations and plain bases for co-clones
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be express...
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanutti...