Over the past years, streaming Web services have become popular, with many of the top Web platforms now offering near real-time streams of user and machine activity. In light of this, Web Observatories now are faced with the challenge of being able to process and republish real-time, big data, Web streams, whilst maintaining access control and data consistency. In this paper we describe the arc...

In recent years, grid technology has had such a fast growth that it has been used in many scientific experiments and research centers. A large number of storage elements and computational resources are combined to generate a grid which gives us shared access to extra computing power. In particular, data grid deals with data intensive applications and provides intensive resources across widely d...

In mobile wireless systems data on air can be accessed by a large number of mobile users. Many of these applications including wireless internets and traffic information systems are pull-based, that is, they respond to on-demand user requests. In this paper, we study the scheduling problems of on-demand broadcast environments. Traditionally, the response time of the requests has been used as a ...

The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generalize traditional B-trees. Contrary to B-trees S(b)-trees provide optimal utilization of keys of variable length, while the data access time remains logarithmical, the same as for B-trees. The main property of the new tree...

An open ended list is a well known data structure in Prolog programs. It is frequently used to represent a value changing over time, while this value is referred to from several places in the data structure of the application. A weak point in this technique is that the time complexity is linear in the number of updates to the value represented by the open ended list. In this programming pearl w...

The main contribution of this paper is a topologyaware storage caching scheme for parallel architectures. In a parallel system with multiple storage caches, these caches form a shared cache space, and effective management of this space is a critical issue. Of particular interest is data migration (i.e., moving data from one storage cache to another at runtime), which may help reduce the distanc...

A new method (the ‘binary indexed tree’) is presented for maintaining the cumulative frequencies which are needed to support dynamic arithmetic data compression. It is based on a decomposition of the cumulative frequencies into portions which parallel the binary representation of the index of the table element (or symbol). The operations to traverse the data structure are based on the binary co...

Tandem’s Data Mining Server (DMS) is a parallel data engine designed to enable data mining tools to store, access and analyse high volumes of data very efficiently. In contrast to traditional database management systems, data structures are optimized for analysis and pattern recognition, rather than for accessing individual rows. The data stored in DMS tables are encoded automatically, so the r...

We present an approach for a generic, multidimensional run-time data structure suitable for highperformance scientific computing in C++. Our approach for associating meta-information with the data structure as well as different underlying datatypes is depicted. The highperformance, multi-dimensional data access is realized by utilizing a heterogenous compile-time container generation function. ...

To meet the demand of the energy consumption, transmission bandwidth, high reliability and real-time transmission for marine-environment monitoring networks, we propose a Real-Time Data Duty Cycle Adaptive (RDDCA) algorithm to improve the Medium Access Control (MAC) layer of IEEE802.15.4 wireless communication standard, and design an architecture of Wireless Sensor Network (WSN) with star topol...