Sciweavers

250 search results - page 42 / 50
» Tree pattern query minimization
Sort
View
DOLAP
2004
ACM
15 years 3 months ago
Experimental evidence on partitioning in parallel data warehouses
Parallelism can be used for major performance improvement in large Data warehouses (DW) with performance and scalability challenges. A simple low-cost shared-nothing architecture ...
Pedro Furtado
VLDB
2007
ACM
114views Database» more  VLDB 2007»
15 years 9 months ago
XRPC: Interoperable and Efficient Distributed XQuery
We propose XRPC, a minimal XQuery extension that enables distributed yet efficient querying of heterogeneous XQuery data sources. XRPC enhances the existing concept of XQuery func...
Ying Zhang, Peter A. Boncz
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
15 years 9 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
PPOPP
2010
ACM
15 years 6 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
INFOCOM
2002
IEEE
15 years 2 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...