Sciweavers

535 search results - page 77 / 107
» Insertion and Expansion Operations for
Sort
View
NETGAMES
2005
ACM
14 years 2 months ago
A challenge for reusing multiplayer online games without modifying binaries
In this paper, we advocate the problem of reusing Multiplayer Online Game (MOG) in Client-Server (C/S) architecture. The problem is that MOG services cannot continue to be provide...
Yugo Kaneda, Hitomi Takahashi, Masato Saito, Hirot...
XIMEP
2005
ACM
150views Database» more  XIMEP 2005»
14 years 2 months ago
Updating the Pre/Post Plane in MonetDB/XQuery
We outline an efficient ACID-compliant mechanism for structural inserts and deletes in relational XML document storage that uses a region based pre/size/level encoding (equivalent...
Peter A. Boncz, Stefan Manegold, Jan Rittinger
CIKM
2005
Springer
14 years 2 months ago
Indexing time vs. query time: trade-offs in dynamic information retrieval systems
We examine issues in the design of fully dynamic information retrieval systems with support for instantaneous document insertions and deletions. We present one such system and dis...
Stefan Büttcher, Charles L. A. Clarke
SEMWEB
2005
Springer
14 years 2 months ago
Web Service Composition with Volatile Information
In many Web service composition problems, information may be needed from Web services during the composition process. Existing research on Web service composition (WSC) procedures...
Tsz-Chiu Au, Ugur Kuter, Dana S. Nau
SIGMETRICS
2004
ACM
106views Hardware» more  SIGMETRICS 2004»
14 years 1 months ago
Performance analysis of BSTs in system software
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
Ben Pfaff