Titlebook: Database and Expert Systems Applications; 10th International C Trevor J.M. Bench-Capon,Giovanni Soda,A Min Tjoa Conference proceedings 1999

Diatribe

嘮叨

VPSF: A Parallel Signature File Technique Using Vertical Partitioning and Extendable Hashinghod uses an extendable hashing technique for dynamic environment and uses a frame-sliced signature file technique for efficient retrieval. Our VPSF method also can eliminate the data skew and the execution skew by allocating each frame to a processing node. To prove the efficiency of our VPSF method

生氣地

A Case for Deltas in Business—to—Business Electronic Commercelication and our software prototype in support of this application. Our main contribution is a software solutions (using Java) that employs the concept of deltas to maintain consistency in a replicated, distributed environment. Our proposed solution strives to be independent of the schema of the bus

Fatten

Flexible Workflow Management Systems: An Approach Based on Generic Process Modelss a result, the workflow management system is not used to support dynamically changing workflow processes or the workflow process is supported in a rigid manner, i.e., changes are not allowed or handled outside of the workflow management system. This paper addresses this problem and tackles it by us

名次后綴

Object-Based Ordered Delivery of Messages in Object-Based Systemsnd response messages. In this paper, we newly define an object-based precedent relation of messages based on a conflicting relation among requests. Here, only the messages to be ordered in the object-based system are ordered. We discuss a protocol which supports the object-based ordered delivery of

innate

Database and Expert Systems Applications978-3-540-48309-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

Grandstand

J. Peralez,V. Andrieu,M. Nadri,U. Serresral but become tractable, and actually highly parallelizable, if restricted to acyclic or nearly acyclic queries..This paper surveys recent results by the authors on tractable classes of conjunctive queries and constraint satisfaction problems and presents a new decomposition algorithm for such problems.

aggrieve

J. Peralez,V. Andrieu,M. Nadri,U. Serresral but become tractable, and actually highly parallelizable, if restricted to acyclic or nearly acyclic queries..This paper surveys recent results by the authors on tractable classes of conjunctive queries and constraint satisfaction problems and presents a new decomposition algorithm for such prob

殖民地

M. Guo,D. Boskos,J. Tumova,D. V. Dimarogonasjects to evolve their structures dynamically, with all necessary impacts on the database schema; to allow, similarly, the creation and display of different plans for evolving the design, like ways of schema evolution, giving in this way a simulation tool for database design and maintenance..Artifici

指派

M. Ba?tu?,L. Hetel,M. Petreczky dividing the object database into three . spaces each hosting . of a particular type and show how relationships from the modelling domain map onto relationships in our categorisation. We present a relationship model and the semantics of relationships. The relationship model is complemented with a m