Sciweavers

415 search results - page 25 / 83
» Efficient Processing of Relational Queries with Sum Constrai...
Sort
View
ICDE
2011
IEEE
273views Database» more  ICDE 2011»
13 years 5 days ago
Shortcut selection in RDF databases
—An increasing amount of data produced nowadays is in RDF format. While significant work has been performed on view selection and query optimization algorithms in relational dat...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
CSCLP
2008
Springer
13 years 10 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
ICDE
2002
IEEE
138views Database» more  ICDE 2002»
14 years 9 months ago
Efficient Temporal Join Processing Using Indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
Donghui Zhang, Vassilis J. Tsotras, Bernhard Seege...
BDA
2004
13 years 9 months ago
Tree Graph Views: On Efficient Evaluation of XQuery in an XML Mediator
XQuery is the emerging standard for querying XML data sources. XLive is a light XML/XQuery mediator developed at University of Versailles whose engine processes an XML algebra der...
Tuyet-Tram Dang-Ngoc, Georges Gardarin, Nicolas Tr...
IS
2006
13 years 8 months ago
Processing approximate aggregate queries in wireless sensor networks
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an a...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...