The following pages link to Information Systems (Q82364):
Displaying 50 items.
- Information systems with attribute decomposition (Q1065565) (← links)
- Taxonomy and formal properties of distributed joins (Q1072721) (← links)
- Losslessness and semantic correctness of database schema transformation: Another look of schema equivalence (Q1072724) (← links)
- The relational model with relation-valued attributes (Q1074345) (← links)
- Batch insertion for tree structured file organizations - improving differential database representation (Q1074348) (← links)
- The INFOLOG linear tense propositional logic of events and transactions (Q1079024) (← links)
- Adding time dimension to relational model and extending relational algebra (Q1094156) (← links)
- Monitoring dynamic integrity constraints based on temporal logic (Q1095682) (← links)
- Redundancy in functional databases (Q1096416) (← links)
- PIQUE: a relational query language without relations (Q1096423) (← links)
- On the irreducible non first normal form relations (Q1096426) (← links)
- Tuple calculus: formal definition and conversion from first-order calculus (Q1097051) (← links)
- Full text retrieval based on syntactic similarities (Q1104141) (← links)
- Adaptive hashing (Q1104735) (← links)
- Representation of vague information (Q1104765) (← links)
- Dynamic-history predictive compression (Q1105564) (← links)
- A Petri-net model of access control mechanisms (Q1108802) (← links)
- Optimizing the cost of relational queries using partial-relation schemes (Q1108822) (← links)
- Concurrency in extendible hashing (Q1108823) (← links)
- Conceptual schemas applied to deductive databases (Q1114443) (← links)
- Extending relational algebra to manipulate temporal data (Q1114451) (← links)
- Maintaining materialized views without accessing base data (Q1115648) (← links)
- Partitioned storage for temporal databases (Q1115651) (← links)
- SIAM: Statistic information access method (Q1115656) (← links)
- Multi-way counting method (Q1123649) (← links)
- A method for hierarchy processing in relational systems (Q1124382) (← links)
- Dynamic query interpretation in relational databases (Q1124384) (← links)
- Formal semantics for database schemas (Q1124390) (← links)
- Organization of quasi-consecutive retrieval files (Q1133338) (← links)
- Reducing block accesses in inverted files by partial clustering (Q1138372) (← links)
- Space utilization and access path length in B-trees (Q1138915) (← links)
- Approximate pattern matching in a pattern database system (Q1138918) (← links)
- Optimizing the evaluation of calculus expressions in a relational database system (Q1138920) (← links)
- An access control facility for relational data base systems (Q1138922) (← links)
- Proceduralism and parallelism in specification languages (Q1139364) (← links)
- A note on optimal allocation of files in a symmetric and homogeneous network (Q1139370) (← links)
- Experiments with a very efficient heuristic for clustering problems (Q1140385) (← links)
- Temporal aspects of logical procedure definition (Q1144955) (← links)
- Algorithms for processing partial match queries using word fragments (Q1144957) (← links)
- The file allocation problem under dynamic usage (Q1145995) (← links)
- On limitations of artificial intelligence (Q1146540) (← links)
- Applications of graph grammar theory to consistency, synchronization and scheduling in data base systems (Q1151055) (← links)
- On data dependency structures of relational databases (Q1151057) (← links)
- Complexity of a proposed database storage structure (Q1151061) (← links)
- Information systems theoretical foundations (Q1152957) (← links)
- Compromisability of a statistical database (Q1161311) (← links)
- The power of inequality semijoins (Q1161313) (← links)
- Optimistic versus pessimistic concurrency control mechanisms in database management systems (Q1162170) (← links)
- Dissimilarity and distance coefficients in automation-supported thesauri (Q1162173) (← links)
- Applying simple theory of types to data bases (Q1162830) (← links)
