Sciweavers

2261 search results - page 317 / 453
» The problem with scalability
Sort
View
VLDB
2007
ACM
114views Database» more  VLDB 2007»
16 years 4 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
VLDB
2008
ACM
102views Database» more  VLDB 2008»
16 years 4 months ago
Extending DBMSs with satellite databases
Abstract In this paper we propose an extensible architecture for database engines where satellite databases are used to scale out and implement additional functionality for a centr...
Christian Plattner, Gustavo Alonso, M. Tamer Özsu
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
16 years 4 months ago
The Piazza peer data management project
A major problem in today's information-driven world is that sharing heterogeneous, semantically rich data is incredibly difficult. Piazza is a peer data management system tha...
Igor Tatarinov, Zachary G. Ives, Jayant Madhavan, ...
PODS
2001
ACM
167views Database» more  PODS 2001»
16 years 4 months ago
Querying Websites Using Compact Skeletons
Several commercial applications, such as online comparison shopping and process automation, require integrating information that is scattered across multiple websites or XML docum...
Anand Rajaraman, Jeffrey D. Ullman
EDBT
2004
ACM
172views Database» more  EDBT 2004»
16 years 4 months ago
Content-Based Routing of Path Queries in Peer-to-Peer Systems
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...
Georgia Koloniari, Evaggelia Pitoura