Data engineering and architecture

671 terms

# A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

  • Inter-relational constraint - An inter-relational constraint is an integrity rule involving more than one relation in a database.
  • Internal Schema - An internal schema describes how a database's data is represented and organized at the storage level.
  • Intra-Relational Constraint - An intra-relational constraint is an integrity rule whose scope is one relation or table.
  • Ishikawa diagram - An Ishikawa diagram, also called a fishbone or cause-and-effect diagram, organizes possible causes of a clearly stated problem into categories.
  • Isolation (database systems) - Isolation is the database-transaction property that governs how concurrent transactions can observe and affect one another.
  • IT disaster recovery - IT disaster recovery is the planned restoration of technology services and data after a major disruption.
  • IT operations analytics - IT operations analytics (ITOA) is the use of analytical methods on operational technology data to understand, troubleshoot and improve IT services.
  • JDBC-ODBC bridge - The JDBC-ODBC bridge is a driver layer that allows Java applications using JDBC, Java Database Connectivity, to access data through an ODBC driver.
  • Jenks natural breaks optimization - Jenks natural breaks optimization is a method for dividing ordered numerical values into a chosen number of classes.
  • Join Method - A join method is the physical algorithm a database uses to combine rows from query inputs according to a join condition.
  • Join-pattern - A join-pattern is a concurrency construct that specifies a reaction requiring messages or calls on several channels together.
  • Key Constraint - A key constraint requires a specified attribute, or combination of attributes, to identify rows uniquely within a relation or table.
  • Key - value database - A key-value database stores information as pairs consisting of a key and its associated value.
  • Keyspace (distributed data store) - A keyspace in a distributed data store is a logical naming scope used to organize data, with the exact meaning depending on the system.
  • Kimball lifecycle - The Kimball lifecycle is a methodology for designing, developing, deploying and maintaining data warehouse and business intelligence solutions.
  • Knowledge as a service - Knowledge as a service, often abbreviated KaaS, is an approach to making organized knowledge available on demand through a service.
  • Knowledge organization
  • Knowledge space - A knowledge space is a mathematical model of feasible knowledge states within a defined domain of items or problem types.
  • Lamport's distributed mutual exclusion algorithm - Lamport's distributed mutual exclusion algorithm coordinates processes so only one at a time uses a shared resource or enters a protected critical section.
  • Landing zone (software) - A landing zone in cloud software architecture is a prepared environment and supporting foundation into which workloads can be deployed.
  • Late Binding - Late binding means deferring a binding decision until a program runs.
  • Layered queueing network - A layered queueing network is a performance model that represents software services and the resources they use across interacting layers.
  • Lean integration - Lean integration applies lean improvement principles to the continuing work of connecting data, applications and business processes.
  • Legal Extension - A legal extension is a particular state of a relation that satisfies the constraints specified for its schema.
  • Library classification - Library classification is the systematic arrangement of library materials into subject-based classes using an established scheme.
  • Linda-like systems - Linda-like systems coordinate concurrent processes through a shared tuple space inspired by the Linda model.
  • Linear belief function
  • Linguistic value - A linguistic value is a word or phrase used as a value of a linguistic variable, such as low, moderate or high for workload.
  • Linked data - Linked data is an approach to publishing and connecting structured data using Web identifiers and explicit relationships.
  • Local-first software - Local-first software gives the user's local copy of data a primary role, allowing useful work without depending on a remote server for each operation.
  • Locale (computer hardware) - A locale is an abstraction representing a group of computing and memory resources within a parallel system.
  • Locks with ordered sharing - Locks with ordered sharing are database concurrency-control mechanisms that permit selected conflicting operations to proceed in a required order while...
  • Log shipping - Log shipping maintains a secondary database by transferring and applying transaction-log information from a primary database.
  • Log trigger - A log trigger is a database trigger used to record changes to a table in a separate log or history table.
  • Logical Data Model - A logical data model describes how information is organized into defined structures, attributes and relationships without specifying the detailed physical...
  • Logical Independence - Logical independence, in database architecture, is the ability to change the conceptual or logical schema without requiring corresponding changes to an...
  • Logical schema - A logical schema describes how a domain's data is structured, including its entities or record types, attributes, relationships and relevant constraints...
  • Logico-linguistic modeling - Logico-linguistic modeling is an approach to knowledge elicitation and representation that extends soft systems modeling with explicit logical treatment of...
  • Long-lived transaction - A long-lived transaction is a transaction whose duration is substantial relative to the system's usual transactions.
  • Long-running transaction - A long-running transaction is an extended unit of work whose completion may span multiple steps, services or waiting periods.
  • Loop dependence analysis - Loop dependence analysis examines relationships between operations in a loop to determine which execution-order constraints must be preserved.
  • Loop-level parallelism - Loop-level parallelism is the opportunity to execute work from multiple loop iterations concurrently while preserving the program's required behavior.
  • Loop scheduling - Loop scheduling determines how the iterations of a parallel loop are assigned to workers or threads.
  • Loop unrolling - Loop unrolling is a program transformation that expands a loop body to perform the work of several original iterations during one pass through the...
  • Lossless join decomposition - Lossless join decomposition is the splitting of a relation into smaller relations so that joining their projections reconstructs exactly the original...
  • Lossless Join Property - The lossless join property means that a relation can be decomposed into smaller relations and reconstructed exactly by joining its projections.
  • Machine-readable document - A machine-readable document is a document whose content is encoded so software can access and process it, rather than relying solely on its visual appearance.
  • Macroprogramming - Macroprogramming is a programming approach that expresses the intended behavior of a collection of computing devices at a system or group level.

Previous page Page 8 of 14 Next page

  • Home
  • Daily AI Updates
  • Blog
  • AIFBL Academy
  • AI Glossary
  • Products and Tools
  • Store
  • Free CFO AI Prompt Pack
  • About Shihan Sheriff
  • Privacy Policy
  • Terms of Use
  • Refund Policy
  • Cookie Policy
  • Earnings Disclaimer