Sciweavers

2859 search results - page 190 / 572
» Querying Complex Structured Databases
Sort
View
ICDE
2011
IEEE
234views Database» more  ICDE 2011»
14 years 5 months ago
Massively parallel XML twig filtering using dynamic programming on FPGAs
Abstract— In recent years, XML-based Publish-Subscribe Systems have become popular due to the increased demand of timely event-notification. Users (or subscribers) pose complex ...
Roger Moussalli, Mariam Salloum, Walid A. Najjar, ...
ER
2001
Springer
136views Database» more  ER 2001»
15 years 6 months ago
A Randomized Approach for the Incremental Design of an Evolving Data Warehouse
A Data Warehouse (DW) can be used to integrate data from multiple distributed data sources. A DW can be seen as a set of materialized views that determine its schema and its conten...
Dimitri Theodoratos, Theodore Dalamagas, Alkis Sim...
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 4 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
ICDT
2007
ACM
97views Database» more  ICDT 2007»
15 years 8 months ago
Combining Temporal Logics for Querying XML Documents
Close relationships between XML navigation and temporal logics have been discovered recently, in particular between logics LTL and CTL⋆ and XPath navigation, and between the µ-c...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
WWW
2004
ACM
16 years 3 months ago
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
Centralized Resource Description Framework (RDF) repositories have limitations both in their failure tolerance and in their scalability. Existing Peer-to-Peer (P2P) RDF repositori...
Min Cai, Martin R. Frank