Reference lists from academic articles are core elements of scholarly communication that permit the attribution of credit and integrate our independent research endeavours. Hitherto, however, they have not been freely available in an appropriate machine-readable format such as RDF and in aggregate for use by scholars. To address this issue, one year ago we started ingesting citation data from t...

In a real-time database system, it is difficult to meet all timing constraints due to the consistency requirements of the underlying database. However, when the transactions in the system are heterogeneous, they are not of the same importance some are of greater importance than others. In this paper, we propose a new optimistic concurrency control protocol called OCC-PDATI which uses informatio...

Alexander Thomasian IBM T. J. Watson Research Center P.O. Box 704 Yorktown Heights, NY 10598, USA The performance of high-volume transaction processing systems is determined by the degree of contention for hardware resources as well as data. Data contention is especially a problem in the case of data partitioned (e.g., distributed) systems with global transactions accessing and updating objects...

The proliferation of online text, such as on the World Wide Web and in databases, motivates the need for space-eecient index methods that support fast search. Consider a text T of n binary symbols to index. Given any query pattern P of m binary symbols, the goal is to search for P in T quickly, with T being fully scanned only once, namely, when the index is created. All indexing schemes publish...

Modern web-based applications are often built as multi-tier architecture using persistence middleware. Middleware technology providers recommend the use of Optimistic Concurrency Control (OCC) mechanism to avoid the risk of blocked resources. However, most vendors of relational database management systems implement only locking schemes for concurrency control. As a consequence a kind of OCC has...

In this paper, the problem of designing network codes that are both communicationally and computationally efficient over packet line networks with worst-case schedules is considered. In this context, random linear network codes (dense codes) are asymptotically capacity-achieving, but require highly complex coding operations. To reduce the coding complexity, Maymounkov et al. proposed chunked co...