Sciweavers

366 search results - page 41 / 74
» Efficient Query Reformulation in Peer-Data Management System...
Sort
View
CIKM
2006
Springer
13 years 11 months ago
SaLSa: computing the skyline without scanning the whole sky
Skyline queries compute the set of Pareto-optimal tuples in a relation, i.e., those tuples that are not dominated by any other tuple in the same relation. Although several algorit...
Ilaria Bartolini, Paolo Ciaccia, Marco Patella
VLDB
2002
ACM
98views Database» more  VLDB 2002»
13 years 7 months ago
Processing Star Queries on Hierarchically-Clustered Fact Tables
Star queries are the most prevalent kind of queries in data warehousing, OLAP and business intelligence applications. Thus, there is an imperative need for efficiently processing ...
Nikos Karayannidis, Aris Tsois, Timos K. Sellis, R...
HPDC
2010
IEEE
13 years 8 months ago
Distributing the power of OLAP
In this paper we present the Brown Dwarf, a distributed system designed to efficiently store, query and update multidimensional data over an unstructured Peer-to-Peer overlay, wit...
Katerina Doka, Dimitrios Tsoumakos, Nectarios Kozi...
ISMIS
2003
Springer
14 years 24 days ago
NETMARK: A Schema-Less Extension for Relational Databases for Managing Semi-structured Data Dynamically
Object-Relational database management system is an integrated hybrid cooperative approach to combine the best practices of both the relational model utilizing SQL queries and the ...
David A. Maluf, Peter B. Tran
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
14 years 7 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis