Sciweavers

3122 search results - page 206 / 625
» Storing Semistructured Data with STORED
Sort
View
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 10 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
FLOPS
2006
Springer
15 years 10 months ago
iData for the World Wide Web - Programming Interconnected Web Forms
Abstract. In this paper we present the iData Toolkit. It allows programmers to create interactive, dynamic web applications with state on evel of abstraction. The key element of th...
Rinus Plasmeijer, Peter Achten
ICCAD
1995
IEEE
144views Hardware» more  ICCAD 1995»
15 years 10 months ago
Background memory management for dynamic data structure intensive processing systems
Abstract -- Telecommunication network management applications often require application-specific ICs that use large dynamically allocated stored data structures. Currently availab...
Gjalt G. de Jong, Bill Lin, Carl Verdonck, Sven Wu...
DASFAA
2007
IEEE
151views Database» more  DASFAA 2007»
15 years 8 months ago
The Tornado Model: Uncertainty Model for Continuously Changing Data
To support emerging database applications that deal with continuously changing (or moving) data objects (CCDOs), such as vehicles, RFIDs, and multi-stimuli sensors, one requires an...
Byunggu Yu, Seon Ho Kim, Shayma Alkobaisi, Wan D. ...
CIDR
2003
123views Algorithms» more  CIDR 2003»
15 years 8 months ago
Managing Expressions as Data in Relational Database Systems
A wide-range of applications, including Publish/Subscribe, Workflow, and Web-site Personalization, require maintaining user’s interest in expected data as conditional expression...
Aravind Yalamanchi, Jagannathan Srinivasan, Dieter...