Database and Expert Systems Applications: 9th International Conference, DEXA'98, Vienna, Austria, August 24-28, 1998, Proceedings (Lecture Notes in Computer Science, 1460)

Front matter
Chapter 1
	Introduction
	A Tour on the TriGS Knowledge Model
		Rules
		Composite Events
		Inheritance of Rules Incorporating Message Events
	Representation and Detection of Composite Events
		Operator Nodes and Leaf Nodes
		Life-Span and Consumption of Events
		Example of Composite Event Detection
		Composite Event Detection in Other Active Systems
	Integrating Composite Event Detection With Rule Scheduling
		Event Injection
		Registering Rules - Building up EIs, ESG and ARB
		Example for the Collaboration Between EIs, ESG, and ARB
	Realizing Inheritance of Rules Incorporating Message Events
	Outlook
	References
Chapter 2
Chapter 3
Chapter 4
Chapter 5
Chapter 6
Chapter 7
Chapter 8
Chapter 9
Chapter 10
Chapter 11
Chapter 12
Chapter 13
Chapter 14
Chapter 15
Chapter 16
Chapter 17
	Introduction
	Event Definition
	Event Detection and Production
	Event Notification
	Toward QUETZAL
	Related Work
	Conclusions and Future Work
	References
Chapter 18
Chapter 19
Chapter 20
Chapter 21
Chapter 22
Chapter 23
Chapter 24
Chapter 25
Chapter 26
Chapter 27
Chapter 28
Chapter 29
Chapter 30
Chapter 31
	1. Introduction
	2. Fuzzy Databases
	3. Mobile and Active Databases in a Common Platform
	4. Fuzzy Rules in Active Databases
		4.1. Fuzzy Events
		4.2. Inter-rule Fuzziness Via Scenarios
		4.3. Similartity Based Event Detection
		4.4. Fuzzy Coupling Modes
	5. Conclusion
	References
Chapter 32
Chapter 33
Chapter 34
Chapter 35
Chapter 36
Chapter 37
Chapter 38
Chapter 39
Chapter 40
Chapter 41
	Introduction
	Related Work
	Buffer
	Index Entry Access Model
	Index Page Access Model
	The BDD LRU Buffer Model
	General Index Buffer Model
	An OID Retrieval Cost Model
		OID Entry Cache
		Total OID Retrieval Cost
	Optimizing OE Cache and Buffer Sizes
		Optimal OE Cache Size Versus Index Size
		Mapping Cost with Different OE Cache Sizes
		The Effect of Different Access Patterns
	Conclusions
	References
Chapter 42
Chapter 43
Chapter 44
Chapter 45
Chapter 46
Chapter 47
Chapter 48
Chapter 49
Chapter 50
Chapter 51
Chapter 52
Chapter 53
Chapter 54
Chapter 55
	Introduction
	Features of DO2
		Object-Identifier
		ISA Hierarchies and Inheritance
		Methods and Late Binding
		Negation
	Language Design in DO2
		Schema Definition
		Language Design
		Rule, Method and Query Definition
	Structure and Implementation of DO2
	Related Works
	Conclusion
	References
Chapter 56
Chapter 57
Chapter 58
Chapter 59
Chapter 60
Chapter 61
Chapter 62
Chapter 63
Chapter 64
Chapter 65
Chapter 66
	Introduction
	Model
	Deciding Whether A Chosen Rule Completes within Its Deadline
		Computing the Probability of Completion
		DECIDE Algorithm
	Issues for Duration and Completion Properties
		Transitivity Issues
		Priority Policy
	The Problem Definition and Complexity
	Heuristic CHOOSE Algorithms for CDP-Satisfaction
		CHOOSE-REGULAR Algorithm
		CHOOSE-ONE-AHEAD Algorithm
	Experimental Results
	References
Chapter 67
Chapter 68
Chapter 69
Chapter 70
Chapter 71
Chapter 72
Chapter 73
Chapter 74
Chapter 75
Chapter 76
Chapter 77
	1. Introduction
	2. A Generic Methodology for Database Reverse Engineering
		2.1 Data Structure Extraction
		2.2 Data Structure Conceptualization
	3. Why Program Understanding in DBRE
	4. Program Understanding Techniques
		4.1 Search in Text Sources
		4.2 Dependency Graph
		4.2 Program Slicing
		4.3 Program Representation
	5. The Tools Provided by DB-MAIN
	6. Conclusion
	References
Chapter 78
Chapter 79
Chapter 80
Chapter 81
Chapter 82
Chapter 83
Chapter 84
Chapter 85
Chapter 86
Chapter 87
Chapter 88
	Introduction
	Semantic Aspects of Schema Integration
	Related Research
	An Enhanced CCA–based Schema Analysis Method
		Schema Interpretation
		Schema Comparison
		Similarity Analysis
	Conclusion and Future Work
	References
Chapter 89
Chapter 90
Chapter 91
	Introduction
	Discovering Nominal Properties
		Computing Rough Entity Synonymies
		Computing Relationship Synonymies
		Computing Refined Entity Synonymies
		Filtering Meaningful Properties
	Extracting Further Structural and Nominal Properties
		Computing Exact Properties
		Computing Conditional Properties
		References
Chapter 92
	1 Introduction
		1.1 Scope of the Proposed System
		1.2 System Features
	2 Review of Related Work
		2.1 Coupling Methods of the OODBMS and IRS
	3 System Architecture
		3.1 Document Indexing Module
		3.2 Document Wrapping Module
		3.3 Document Storage Module
			3.3.1 Data Model in the Object-Oriented Database
			3.3.2 Data Modeling
			3.3.3 Modeling of Compound Documents for a Document Library
		3.4 Document Retrieval Module
	4 A Signature File Based Approach for Multi-lingual Information Retrieval
		4.1 Similar Token Grouping and Signature Determination
		4.2 Token-based Signature Generation
	5 The Hierarchical Query Approach
		5.1 Object-level Queries: document retrieval based on the original OODBMS queries
		5.2 Best Match Search for Quasi-Natural Language Queries
		5.3 Signature-based Fast Search
	6 Conclusions
	References
Chapter 93
	Introduction
	Preliminaries on the signature file approach
	Rectangular decomposition
		Prelimanary concepts
		Decomposition algorithm
		Signature Extraction method
	Super-rectangular organisation
	Search operation
		Single term query
		Multiattribute retrieval
	Performance evaluation
		Analytic cost model
		Symbols specification
		Parameters evaluation
		Performance comparaison through experiments
	Conclusion
	References
Chapter 94
	1 Introduction
	2 Cumulative Duality in Information Discovery
		2.1 Duality in Information Discovery
		2.2 Cumulative Duality in Directed Communication
		2.3 Cumulative Duality Matrix
	3 Instantiations of CD Matrices
		3.1 Partial Environmental Knowledge
		3.2 Privacy of Interset and Content
		3.3 Dynamical Interest and Content
	4 Other Cumulative Dual Criteria
	5 Conclusions & Further Research
	References
Chapter 95
	1. Introduction
	2. Background
		2.1 Implementation
	3. System Design
	4. Implementation
	5. Conclusion
	References
Chapter 96
	1 Introduction
	2 Transaction Model
	3 Transaction Management Mechanisms
	4 Prototype Collaborative Database Application
	5 Conclusion
	References
Chapter 97
	1 Introduction
	2 Spatiotemporal Phenomena
		2.1 Components and Behavior
	3 Definitions and the Model
		3.1 Spatiotemporal Databases
		3.2 Spatiotemporal Constraints
	4 The Extended Entity-Relationship Model
		4.1 The Constructs of the Extended ER Model
		4.2 The Formal Syntax of the Extended ER Model
	5 Example of Use
	6 Conclusions and Further Research Plans
	References
Chapter 98
	Introduction
	Spatial Representation of Rule Bases
		Note on Tesseral Addition and Subtraction
	V&V Algorithms
	Evaluation
	Conclusion
Chapter 99
	Introduction
	Motivating Examples
		Dangling Links in Hypertexts
		Broadcast Hypermedia
	Time Dependent Link
		Anchor and Container
		Link Definition
		Transaction Time and Valid Time of Nodes
		Temporal Validity of Links
		Creation and Expiration of TDL
	Link Control Mechanism
		Management of Dangling Links
		Features of Broadcast Hypermedia
		Control of Broadcast Hypermedia
	Prototype System Mille-feuille
	Concluding Remarks
Chapter 100
	Introduction
	The Ordered relational Model
	Functional Dependencies (FDs) in Ordered Databases
	Ordered Functional Dependencies (OFDs)
		OFDs Arising from Pointwise-Orderings
		OFDs Arising from Lexicographical Orderings
	Concluding Remarks
	References
Chapter 101
	Introduction
	Related Work
	The Problem of Consistent Sample Database Extraction
		Properties of Prototype Databases
		The Faculty Database Example
		Challenges in the Database Sampling Process
	Insertions Chain Graph
		Definition of ICG
		Example of ICG
		Expressiveness of ICG
	Consistent Database Sampling Method
		Algorithm
		Termination and Correctness
	Conclusions and Future Research
	References
Chapter 102
	Introduction
	The Notions of Method Chunk and Method Path
		Method Chunk
		Method Path
	The Notions of Software Chunk and Software Path
		Software Chunk (SC)
		Conclusion
		Software Path
	Illustration of One CREWS Method Path in L’écritoire Software Tool
	References
Chapter 103
	1 Introduction
		1.1 An Overview to the TOODOR Data Model
	2 The Temporal Document Retrieval Language
		2.1 TDRL Syntax
		2.2 Temporal Predicates
		2.3 Granularity
		2.4 Chronicles
			2.4.1 Other Types of Chronicles
	3 Conclusions
	References
Chapter 104
	Introduction: Towards Precision-Oriented Systems
	The Necessity of a More Powerful Formalism
	The Indexing Model
	Indexing Each Image by a Conceptual Graph: A Computer-Assisted Process
	An Optimized Index Organization: An Algebraic Approach
	Experimentation and Results
		An Improved Precision
		A Faster Retrieval
	Conclusion
	References
Chapter 105
	Introduction
	The Repository
	Application Examples
		Addressing Documents of Various Types
		Content-Based Retrieval with Additional Conditions
		User-Defined Similarity Measures
		Selecting Similar Pairs
	Integrating the Retrieval Facilities into a CASE Tool
	References
Chapter 106
	Introduction
	The French \"Inventaire\" project
	Extending User Interaction
	Two-Level Interoperability Architectures
		Partial data integration
		User interface integration
	The \"Inventaire\'\' Prototype
	Future Work - The Mediated Perspective
	Related Work and Conclusion
	References
Chapter 107
	1 Introduction
	2 The Active HYpermedia Delivery System (AHYDS)
		2.1 Requirements of Hypermedia Document Retrieval Applications
		2.2 Handling SGML/HyTime Documents within an AODBMS
		2.3 Architecture of the AHYDS Platform
	3 Technical Aspects of the Hypermedia Document Management
		3.1 The HyTime Plugins
		3.2 Document Retrieval Queries
	4 Performance Experiments
		4.1 Configuration
		4.2 Performance Results
			Performance Evaluation of the Response Time
			Inter-operation parallel
			User scalability and Elapsed Time
			User scalability and number of documents delivered per second
	5 Related Works
	6 Conclusion
	References
Chapter 108
	1 Introduction
	2 IO&T representation
		2.1 Fuzzy orientation category
		2.2 Intrinsic orientation
		2.3 IO&T representation scheme
	3 Picture retrieval
		3.1 Similarity functions
		3.2 Object based similarity
		3.3 IO&T similarity measure
		3.4 Similarity retrieval approach
		3.5 An example and experiments
	4 Conclusion and future work
	References
Chapter 109
	Introduction
	The Approach
	The Qualitative Level of Representation
		Assumptions
		Capturing Topology- The Adjacency Matrix
		Capturing Orientation: The Matrix Map
		Defining Composite Data Sets Qualitatively
		Representation of Ambiguity or Inconsistency
	Representing the Consistent Set of Knoweldge
		Different Levels of Spatial Consistency
	An Example
	Conclusions
	References
Chapter 110
	1 Introduction
	2 Related Work
	3 Overview of Our Spatial Exploration Environment
	4 SVIQUEL Interface
		4.1 Relative Spatial Queries
		4.2 The SQUIVEL Sliders (S-sliders)
		4.3 Integrated Neighborhood Concept for Topology and Direction
	5 APIQ: An Active Picture for Qualitative Querying
	5.1 Direct Manipulation in APIQ
	5.2 APIQ: Qualitative Query Representation
	6 Conclusions
	References
Chapter 111
	Introduction
	Motivations
		Minimizing impacts of schema changes
		Modeling specific requirements
	Extending the relational view definition language
		Terminology
		The sample schema
		The extended view definition language
	Impact of the sources schema changes on Views
		Propagation of the schema extension
		Propagation of delete an attribute
		Propagation of an attribute type modification
	Direct view schema changes
		Extension of a view
		Delete an attribute in a view schema
		Modify an attribute type
	Related work
	Conclusion
	References
Chapter 112
	Introduction
	Base Concepts
		Deductive databases
		Queries, Query Containment and IC-compliant Query Containment
		View Updating
	Query Containment Checking by View Updating
	IC-compliant Query Containment by View Updating
	View Updating Methods for Containment Checking
	Related Work
		Query Containment with Safe Stratified Negation.
		IC-compliant Query Containment
	Conclusions and Further Work
	References
Chapter 113
	Introduction
	Basic Definitions and Notation
	View Update Translation
	Inverse-Images: Formalism and Computation
		Definitions, Notation
		Inverting the Relational Algebra
	View Update Translations Using Inverse
		Relationship between Translations and Inverses
		View Update Determinism
		Performing View Updates: An Overview
	Conclusion
	References
Chapter 114
	1 Introduction
	2 GAs and Rule-Based Agents
	3 An Example Application: Self-Adaptive Networks
	4 Experiments and Results
	5 Conclusions
	Acknowledgments
	References
Chapter 115
	1 Introduction
	2 Processing of Constrained Queries
		2.1 A-Priori Information
		2.2 Brute Force (Linear Search), Binary Search and Hashing
		2.3 Sampling
		2.4 Sampling for Processing Constrained Queries
	3 Genetic Algorithms (GAs) for Search and Optimization Problems
		3.1 Variations of GAs
		3.2 Hybrid Algorithms
	4 Our Algorithm - (Hybrid-GA)
		4.1 Experimental Results of Hybrid-GA
	5 Conclusion and Future Work
	References
Chapter 116
	Introduction: Goals, requirements, notations
	The kernel model: Things, types and features
		Basic assumptions: Things, properties, actions and associations
		Features and types
		Data types and object types
		Instances and classes
	Relationships
		Referential features
		Generalisation and specialisation
		Associations and roles
		Aggregation
	Elements for modelling system dynamics
	Conclusions and summary
	References:
Chapter 117
	1 Introduction
	2 The PRODNET II Supporting Platform for VEs
	3 Management of Shared Information in PRODNET II
		3.1 Analyzing the Shared and Exchanged Information
		3.2 General Schema Design for the PCL Information
	4 Design of the DIMS Federated Architecture
		4.1 Data Exportation/Importation and Visibility Rights
		4.2 General Design for Distributed/Federated Query Processing
	5 Conclusions
	References
Chapter 118
	1 Introduction
	2 The Object Model
	3 Conceptual Database Evolution (CDE)
		3.1 The Schema Model
	4 Mapping from the Object Model to the Schema Model
		4.1 Example CDE Cases
	5 Summary and Conclusions
	References
Chapter 119
	Introduction
	The Product Development Process
		The Product Development Process Modeling Approach
	The CAME Environment and its Architecture
	Supporting the GDPT
		Data Modeling and Population Generation
		Activity Object
		Information Object
		Subject Object
		The Meta Model
		Activity Structure Chart
		Information Structure Chart
		Organization Structure Chart
		Create/Use/Own Matrix
		Task Allocation Matrix
		IDEF-0 like Diagram
	The Conclusions and Discussion
	References
Chapter 120
	Introduction
	Architecture of Persistence API
	RMI Persistence API
	CORBA Persistence API
	Comparison and Outlook
	References
Chapter 121
	Introduction
	Specification of Performatives
	Specifying the Use of Performatives
	Example Information Sharing Conversations
	Specification of tell
		Conditions Derived From the Conversation Classes
		Conditions Derived From Policies and Heuristics.
	Discussion
	Conclusion
Chapter 122
	Introduction
	An Overview of HEROS
	Schema Architecture
	HEROS Transaction Model
	HEROS Implementation
	Related Work
	Final Comments
	References
Chapter 123
	1 Introduction
	2 Related Work
	3 Nested Transaction Support
		3.1 Nested Transaction Model
		3.2 Mapping Processes onto Nested Transactions
		3.3 Mapping from Nested Transaction Model to Flat Transaction Model
		3.4 Mapping from Flat Transaction Model to Database Specific Transactions
	4 Architecture
		4.1 Nested Transaction Manager
		4.2 Nested Transaction Objects
		4.3 Flat Transaction Interface
	5 Implementation
	6 Conclusions
	References
Chapter 124
	Introduction
	Concurrency and Synchronization
		The Model
		Intra-Agent Concurrency and Synchronization
		Inter-Agent Communication and Synchronization
	The Agent Transaction Model
		Well-Structured Agent Execution
		Schedule Correctness
	Managing Agents at Run-Time
	Conclusions and Related Work
	References
Chapter 125
	Introduction
	System Model
	Significant Precedence
		Precedence of operations
		Significant precedence
		Ordered delivery
	Protocol
		Object vector
		Message transmission and receipt
		Message delivery
	Concluding Remarks
	References
Chapter 126
	Introduction
	Overview of Aurora
		Uniform Containers for Plug-Compatibility
		Communication Infrastructure
		Specification of Composition
		Service Composition and Work Session Management
		Repository Service
	Work Session Management
	Related Work
	Conclusions
	References
Chapter 127
	Introduction
	The Fragmentation and Allocation problem
	A step-by-step secure conceptual disign phase methodology
	The experimantal implementation
	Conclusion
	References
Chapter 128
	1 Introduction
	2 Modeling of subjective interpretation for landscape assessment
		2.1 Definition
		2.2 Methodology
	3 Subjective interpretation for landscape assessment
	4 Relationship between graphical descriptors and adjectives
		4.1 Graphical descriptors relating to subjective interpretation
		4.2 Graphical descriptors: evaluation
		4.3 Graphical descriptors: texture
		4.4 Graphical descriptors: openness
	5 Relationship between graphical descriptors and subjective interpretations
	6 Experiment 2: test of image retrieval system
	6 Conclusion
	References
Chapter 129
	Introduction
	Dexter Model and Its Semantics
		The Node and Link Structure
		Semantics of the Node Structure
	Extended Hypermedia Model
		Static Type Abstractions
		Operation Abstractions
		Extending Component Structure
		Adding Schema Constructors
	Conclusion
	References
Chapter 130
	Introduction
	Related works
		Retrieval of structured documents
		Synthesis
	Propagation mechanisms in structured documents
		Coverage and dependencies
		The scope of attributes
		One example of scope of attribute
		The structural indexing process
	The retrieval strategy
	Application
		Overview of the application
		Querying and browsing documents
	Conclusion and Outlook
	References
Chapter 131
	Introduction
	Related Work
	The Personal Evolvable Advisor
	User Interest Profile
	Conclusion
	References
Chapter 132
	1 Introduction
	2 Related Work
	3 Interval B+trees
	4 Time-splits
	5 Experimental Results
	6 Conclusion
	References
Chapter 133
	Introduction
	Related Work and Motivation
	Proposed Method
		Insertion
		Search
		Correctness
	Performance Evaluation
		Space overhead
		Insertion time
		Search time
	Conclusions
	References
Chapter 134
	1 Introduction
	2 An Embedded Valid Time Query Language
		2.1 Operations not involving cursors
			The SELECT Statement (“singleton” form).
			The INSERT Statement.
			The DELETE and UPDATE Statements (non-Cursor Forms).
		2.2 Operations involving cursors
			The DELETE Statement (Cursor Version).
			The UPDATE Statement (Cursor Version).
	3 Design of an EVTQL Architecture
		3.1 The EVTQL Preprocessor
			Embedded VTQL statement translation.
			Implementing the WHENEVER statements.
		3.2 The EVTQL Library
			The SELECT statement (“singleton” form).
			The INSERT statement and the non-cursor versions of the DELETE and UPDATE statements.
			The OPEN statement.
			The FETCH statement.
			The DELETE statement (cursor form).
			The UPDATE statement (cursor form).
			The CLOSE statement.
	4 Conclusions-Future Work
	References
Chapter 135
	Introduction
	Related Work
	Our Mobile Transaction Model
		Prewrite Processing in Mobile Computing Environment
	Concurrent Operations and Locking
	Serializable Schedules in Mobile Transaction Processing
		Proof of Correctness
	Conclusion
	References
Chapter 136
	1 Introduction
	2 Distributed Transaction Model
	3 The Single-Phase Atomic Commit Protocol
		3.1 Informal Description
		3.2 Hypotheses on Participating DBMSs
		3.3 Protocol Description
	4 Achieving Non-Blocking
		4.1 System Model
		4.2 The Non-Blocking Single-Phase ACP Algorithm
	5 Recovering Failures
	6 Performance Analysis
	7 Conclusion
	References
Chapter 137
	1 Introduction
	2 Global and Local Objects
	3 General Architecture
		3.1 DBMS Client Module
		3.2 DBMS Server Module
		3.3 Garbage Collection
		3.4 About Transaction Management and Garbage Collection
	4 Global Garbage Collector
		4.1 Entry and Exit Item Data Structures
		4.2 Updating Entry and Exit Item
		4.3 Reverse Mark and Sweep Algorithm
	5 Conclusion
	References
Chapter 138
	1 Introduction
	2 General Problems with the Administration of Routing Plans
		2.1 Important Terms in the Field of Routing Plans
		2.2 Administration of Variant Specific Routing Plans
	3 The Concept of the Rule-Based Routing Plan Processor
	4 Conclusions
	References
Chapter 139
	1 Introduction and Motivation
	2 Twin-Base Acquaintance Model
	3 Tri-Base Acquaintance Model
		3.1 Tri-Base Model as an Extension of the Twin-Base Model
		3.2 Structure of Bases within the Model
		3.3 Process of Updating the Model
	4 Community Lifecycle
		4.1 Generation of Plans
		4.2 Communication Traffic
	6 Tri-Base Model in the Production-Planning Domain
	7 Conclusions
	References
Chapter 140
	Introduction and Natural Language Understanding
	Common-Sense Domain Knowledge
		Common-sense Domain Knowledge and Frames
	Design Framework and Open Architecture
		The Architecture and the Components
	Understanding an Application Domain Framework
		The Property of the K-Structure for the Interrogatives
	Description of the proposed Lexicon and Object Model
		The Functional Behaviour of Verbs, Nouns, and their Linguistic Associations
		The Relationships Between the Object Domain Model and the LFG Structures
	Conclusion and Further Developments
	References
Chapter 141
	Introduction
	Related Work
	Background
		Web Data Model(WDM)
		Motivating Example
	Concept of Web Join
	Join Existence
	Summary and Future work
	References
Chapter 142
	Introduction
	TENTACLE Data Model
	The Querying and Programming Language
	TENTACLE as a Web Server
	Conclusion and Future Work
	References
Chapter 143
	Introduction
		Process modeling
		Process reengineering
		Implementation and automation
		Strong points of our contribution
	Process modeling
		The abstract level
		The descriptive level
		The prescriptive level
		Steps of specification
	Process implementation
		Structure of Workey applications
		Implementation of a workflow application
	Process automation
	Conclusion
	References
Chapter 144
	1 Introduction
	2 Remote Cache Management
		2.1 Partial Containment by Cache
		2.2 Conjunctive Conditions
		2.3 Query Simplification
	3 The Condition Dependency Graph (C D Graph)
		3.1 Condition Matching
		3.2 Maximum Pathlength in the CD Graph
		3.3 Merging Antecedent Ranges
		3.4 Maximum Out-Degree of Graph Vertices
	4 Rule or Condition Match Algorithms
	5 Conclusions
	References
Chapter 145
	Introduction
		1.1 Basic Concepts
	Cost Model for Horizontal Class Partitioning
		Cost of Executing a Single Query on Unpartitioned Classes
		Cost of Executing a Single Query on Partitioned Classes
	Horizontal Class Partitioning Algorithms
		Cost-Driven Horizontal Partitioning Algorithm
		Approximate Horizontal Class Partitioning Algorithm
		Evaluation of the Algorithms
	Conclusion
	References
Chapter 146
	Introduction
	Concepts for Semantic Data Modeling
	The Previous Approach
		Fragmentation Based on Equality Predicates
		Some Weakness of the Previous Approach
	An Extended Approach to Conditional Fragmentation
		An Extended Meta Model
		Additional Rules
	Discussion
	REFERENCES
Chapter 147
	Introduction
	Data Representation
	Query Language
	Conclusions
	Acknowledgement
	References
Chapter 148
	Introduction
	The Join Ordering Algorithm
	The GOO Algorithm
	Performance Evaluation
	Related Work
	Conclusion and Future Work
	References
Chapter 149
	Introduction
	Preliminaries
	The Algorithms
		Bucketing
		Naive Algorithm
		Iterative Algorithm
		Some Considerations
	Experimental Results
	Comparisons and Concluding Remarks
	References
Chapter 150
	Introduction
	Database Architectures
		The ANSI/SPARC Three-Level Architecture
		Architectures for Federated Database Systems
	Data Warehouse Architectures
		Data Warehouse-Centered Architecture
		Operational Data Store / Data Warehouse Architecture
		Data Warehouse / Data Marts Architecture
	An Integrated Database Architecture for Data Warehousing
		The Schema Architecture
		The Data Warehouse Data Model
		Data Warehouse Data
		The Database Data Dictionary
	Conclusions and Future Work
	Acknowledgements
	References
Chapter 151
	Introduction
	Background and related work
	The platform
	An experiment with spatial join algorithms
	Conclusion and future work
	References
Chapter 152
	Introduction
	Problems of Updating
		Data Extraction
		Data Transformation
	Data Approximation
		Credibility Measures
		Credibility Representation
		Data Checking
	Data Predictions
	Parameterized Data Forgetting
	Agent-Based Implemetation
		Approach Description
		Features
	Summary
	References
Chapter 153
	1 Motivation
	2 Related Work
	3 The DYVER Approach
	4 The DYVER Algorithm
		4.1 Modifying the relation scheme and meta data
		4.2 Maintenance
			4.2.1 External Maintenance
			4.2.2 Internal Maintenance
		4.3 Querying
	5 Conclusion
	References
Chapter 154
	Introduction
	Problem Description
		FML Itemsets and FML Rules
	Finding Large FML Itemsets
	Finding Strong FML Rules
	Conclusions
	References
Chapter 155
	Introduction
	Mining Temporal Patterns
		Temporal Patterns
		Mining Problem
		An Example of Temporal Patterns: Temporal Association Rules
	A Temporal Discovery Language
		Brief Syntax of TQML
		An Example: Mining Temporal Association Rules
	A Prototype System Architecture
	Conclusions
	References
Chapter 156
	Introduction
	Facilities Management
	KDD in a Multi-Database Environment
		Entity Integration Techniques
		Query Language Extensions
	An Architecture for Mining Heterogeneous Databases
	Current Status and Future Plans
	References
Chapter 157
	Introduction
	Topology preserving self-organizing neural networks
		Self-organizing maps
		Hierarchical feature maps
		Comparison of both models
	Document representation
	A map of the world
	An atlas of the world
	Conclusions
	References
Chapter 158
	1 Introduction
	2 Databases as Knowledge
		2.1 Databases as Bacground Knowledge
		2.2 Concept Learning from Databases
	3 Concept Formation from Databases
		3.1 Databases and Type Hierarchy
		3.2 Concept Formation by SOP Expressions
	4 Concept Formation Based on Characteristics
		4.1 Conditional Sum-of-Product Expressions
		4.2 Processing Concept Formation
		4.3 Algorithms
	5 Experimental Results
	6 Related Works
	7 Coclusion
	References
Chapter 159
	1. Introduction
	2. Background
	3. Rule extraction under uncertainty
	4. The formal model and its application
	5. Conclusion
	References
Chapter 160
	Introduction
	Related Work
	Semantic and Transfer Links
	Library Life-Cycle Development
		The Conceptual Level
		The Ontological Level
		Ontology of Generalisation
		Ontology of Specialisation
		Re-Use of Task/PSM/Domains/Links:
	The Concentrator Location Problem
	Object Level
	The Library: Multi-hierarchical Y Model
	Conclusion
	Bibliography
Chapter 161
	Introduction
	Rough Sets Based Classi cation
		Rough Sets and Information Reduction
		Finding Reducts with User Speci ed Criteria
	Updating Derived Rules
		Updating Candidates
		An Example
	Conclusions
	References
Chapter 162
	Introduction
	Preliminary Definitions
		Active and Deductive Rules
		Semantics of DATALOG
	Desirable Properties of Active Programs
	Declarative Semantics for Update Programs
		Well-Founded Semantics
		Max-Deterministic Semantics
		Total Deterministic Semantics
		Unique Total Stable Model Semantics
Chapter 163
	Introduction
	Deductive Databases Schemas Considered
	Our Visual Schema Language
		Visual Base Predicates
		Visual Derived Predicates and Visual Deductive Rules
		Integrity Constraints
		Other Features
	Related Work
	Conclusions and Further Work
	References
Chapter 164
	Introduction
	Syntax
	Semantics
	Conclusion