Sciweavers

143 search results - page 5 / 29
» Query Order and the Polynomial Hierarchy
Sort
View
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
14 years 11 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...
WWW
2003
ACM
14 years 10 months ago
On labeling schemes for the semantic web
This paper focuses on the optimization of the navigation through voluminous subsumption hierarchies of topics employed by Portal Catalogs like Netscape Open Directory (ODP). We ad...
Vassilis Christophides, Dimitris Plexousakis, Mich...
DEXA
2009
Springer
175views Database» more  DEXA 2009»
14 years 4 months ago
RoK: Roll-Up with the K-Means Clustering Method for Recommending OLAP Queries
Dimension hierarchies represent a substantial part of the data warehouse model. Indeed they allow decision makers to examine data at different levels of detail with On-Line Analyt...
Fadila Bentayeb, Cécile Favre
ISMB
1994
13 years 11 months ago
Using Interval Logic for Order Assembly
Temporallogic, in particular, interval logic has been used to represent genomemapsand to assist genome mapconstructions. However,interval logic itself appears to be bruited in its...
Zhan Cui
IFIP
2004
Springer
14 years 3 months ago
On Complexity of Model-Checking for the TQL Logic
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
Iovka Boneva, Jean-Marc Talbot