n
Abbreviation of second normal form. [(databases) A stage in the normalization of a relational database in which it is in first normal form and every non-key attribute is dependent upon the entire primary key.]
n
One who uses an abacus in casting accounts; a calculator.
n
(databases) Acronym of atomicity, consistency, isolation, and durability, a set of properties that guarantee database transactions are processed reliably. [(uncountable) The quality or state of being atomic.]
n
(databases) A function that takes input from various rows at once.
n
(computing) A script written in this language.
n
(software engineering) A standard design used in software architecture with a broader scope than design patterns.
n
(programming) Any of various data structures designed to hold multiple elements of the same type; especially, a data structure that holds these elements in adjacent memory locations so that they may be retrieved using numeric indices.
n
(computer languages, informal, chiefly uncountable) Assembly language.
n
(databases, countable) A type of join from a table to itself.
adj
Of or relating to Charles Babbage (1791–1871), English mathematician and engineer who originated the concept of a programmable computer.
n
(databases) LOB datatype accessible directly from the operating system, without using the DBMS.
n
Data on a very large scale, such that it can only be gathered or processed with computers, especially with reference to its potential to allow for new breakthroughs or understanding in a particular field of study.
n
(databases) A pointer found in a nonclustered index to a row in a clustered index or a table heap
n
(databases) A stage in the normalization of a relational database in which a database is in third normal form and all determinants are candidate keys.
n
A set of techniques and tools for the acquisition and transformation of raw data into meaningful and useful information for business analysis purposes.
n
Abbreviation of calculator. [A mechanical or electronic device that performs mathematical calculations.]
n
(obsolete) A set of mathematical tables.
n
(computing, databases) In the design of a database table, a column (or an irreducible group of them) able to identify every row of the table. One of the candidate keys (abbreviated CKs) will be the primary key.
n
(databases) In MongoDB, a fixed-size collection that, once the size limit has been reached, replaces the oldest record whenever a new one is added.
n
(databases) All possible combinations of rows between all of the tables listed.
n
Alternative letter-case form of CFG [(computing) A configuration file.]
adj
(databases, of a primary key) Used as the clustering key of a clustered index.
n
(databases) a type of database index that physically sorts the data in a table on the disk to match the criteria specified by the index.
n
(databases) A database field whose values serve as the keys of a clustered index.
n
(databases) In a DBMS, a point in time at which all updates to a database, or group of records in a database, are guaranteed to have been written to disk, and the journal or log records of that action have also been so committed. Future updates may be undone to that point if necessary.
n
(databases) A key constituted by several fields, including one which is not a superkey.
n
(databases) A key which is constituted by several fields.
n
(computing) The design of products and processes through the use of digital means, integrating digital technology.
n
The study of computers and their architecture, languages, and applications, in all aspects, as well as the mathematical structures that relate to computers and computation.
n
(computer science) The use of a computer or computers.
n
One who performs computus (calculation of the date of Easter).
n
(computing) A text string that specifies information about a database or other data source and the means of connecting to it.
n
(computing, databases) A join that returns a Cartesian product.
n
(databases) A mapping between equivalent elements (fields) in different database schemas.
n
(databases) The manual updating of information in a database.
n
(databases) A reference to a row of data in a table, which moves from row to row as data is retrieved by way of it.
n
(computing) A representation of facts or ideas in a formalized manner capable of being communicated or manipulated by some process.
n
(computing) An object in programming that provides an abstract interface to some type of persistence mechanism, providing some specific data operations without exposing details of the persistence layer.
n
Alternative spelling of databank [A database (collection of organized information in a regular structure)]
n
Obsolete spelling of database [(general) A collection of (usually) organized information in a regular structure, usually but not necessarily in a machine-readable format accessible by a computer.]
n
(computing) A very large three-dimensional array or table
n
(computing) A document or repository that describes the data and metadata within a system.
n
(computing) The part of a COBOL program in which the format and layout of external files and databases, and internally-used variables and constants are defined
n
The process of ensuring high data quality within a company.
n
The provision of unified access to data residing in different data schemas.
n
A massive, easily accessible data repository built on inexpensive computer hardware for storing big data.
n
All the disciplines related to managing data as a valuable resource, such as data modeling or metadata management.
n
The access layer of a data warehouse environment, used to distribute a subset of the data to users.
n
(databases) A technique for searching large-scale databases for patterns; used mainly to find previously unknown correlations between variables that may be commercially useful.
n
(databases) A result of applying a data modeling to some particular application, using a database model such as relational.
n
(databases) part consisting of several uniquely named components called data fields in the database structure
n
(statistics) A set of data to be analyzed.
n
(computer science) Any way of storing and organizing data in a computer so that it can be accessed efficiently.
n
(databases) A table stored in, or derived from, a database.
n
(computing) A collection of data, from a variety of sources, organized to provide useful guidance to an organization's decision-makers.
n
The use of a data warehouse.
n
Alternative spelling of data mining [(databases) A technique for searching large-scale databases for patterns; used mainly to find previously unknown correlations between variables that may be commercially useful.]
n
An organization dedicated to maintaining a database.
n
(general) A collection of (usually) organized information in a regular structure, usually but not necessarily in a machine-readable format accessible by a computer.
n
(databases) A person who is responsible for the logical and physical design of databases, and normally for all aspects of their recoverability, integrity, security, availability and performance.
n
(computing) a person who is responsible for the logical and physical design of databases
n
The underlying component that a database management system uses to create, retrieve, update and delete data.
n
(databases) A suite of interrelated computer programs designed to manage message processing and database update in a tightly controlled manner.
n
Any fundamental way of organizing data in a database, such as the hierarchical model, the network model or the relational model.
n
(computing) the production of catalogues, price lists etc, using data from a database
n
(databases) A unit of interaction in a database management system.
n
Alternative spelling of data centre [A facility used to house computer systems and associated components, such as telecommunications and storage systems.]
n
Alternative spelling of data centre [A facility used to house computer systems and associated components, such as telecommunications and storage systems.]
n
Alternative spelling of data cube [(computing) A very large three-dimensional array or table]
n
A set of data collected from a single source.
n
The field of computer science.
n
Alternative form of data mart [The access layer of a data warehouse environment, used to distribute a subset of the data to users.]
n
Alternative spelling of data mining [(databases) A technique for searching large-scale databases for patterns; used mainly to find previously unknown correlations between variables that may be commercially useful.]
n
Alternative spelling of data set [(computing) A file of related records on a computer-readable medium such as disk, especially one on a mainframe computer; a dataset.]
n
(computing, databases) A display of the records in a table, arranged in rows and columns.
n
A collection of data that is less formally structured than a database.
n
Alternative form of data store [(computing) A data repository of a set of integrated objects.]
n
Alternative form of data structure [(computer science) Any way of storing and organizing data in a computer so that it can be accessed efficiently.]
n
Alternative spelling of data type [(programming) A classification or category of various types of data, that states the possible values that can be taken, how they are stored, and what range of operations are allowed on them.]
n
Alternative form of data warehousing [The use of a data warehouse.]
n
(computing) An early database management system for microcomputers
adj
(databases, of a schema) Containing redundant data to improve performance.
n
(computing) An associative array, a data structure where each value is referenced by a particular key, analogous to words and definitions in a dictionary (sense 1).
n
(computing) The recording or storing of information (data) in a digital, machine-readable medium.
n
(computing) Abbreviation of directory. [A list of names, addresses etc, of specific classes of people or organizations, often in alphabetical order or in some classification.]
n
(computer science) A decentralised distributed system that performs the functions of a hash table.
n
(programming) A directive that associates an SGML or XML document (such as a webpage) with a Document Type Definition, potentially affecting how it is parsed and rendered.
adj
(databases) Storing data in documents without a schema, which allows for arbitrary structuring of the data.
n
(data processing) A form of technical metadata that represent the type of a data item, its characteristics, name, and usage.
n
(computing, databases) A data set taken from a larger database and linked back to it, so that local changes to the data are propagated back to the parent database.
n
(software) the disposition and interrelationship of all the management, information and computing systems within an organization
n
The set of diagrams and metadata which fully defines and describes an enterprise architecture.
n
(databases) Anything about which information or data can be stored in a database; in particular, an organised array or set of individual elements or parts.
n
(databases) An individual value or measurement at the lowest level of granularity in a data warehouse.
n
(databases, data warehousing) A database table consisting of the measurements, metrics or facts of a business process.
n
(databases) A stage in the normalization of a relational database in which a database is in fourth normal form and every join dependency is implied by the candidate keys.
n
(databases) A collection of files that, in some database systems, are managed together as a group.
n
(databases) A stage in the normalization of a relational database in which repeating groups and attributes have been eliminated by putting each into a separate table connected by a primary-key/foreign-key relationship.
n
(databases) A query that operates against data from an earlier time, before it was changed.
n
(databases) A column (or group of columns) in a relational table that identifies another table, so that items in the two tables can be conceptually linked.
n
The code in a markup language which determines a document's format.
adj
(computer languages) Resembling or characteristic of Fortran.
n
(databases) A stage in the normalization of a relational database in which a database is in Boyce-Codd normal form and all multi-valued dependencies are functional dependencies.
n
(databases) Short for full outer join. [(databases) A join yielding a set of records for two tables, where all rows of the "left" table are enlisted with all rows of the "right" table, even if the join condition does not find any matching row on the "left" or on the "right" table.]
n
(databases) A join yielding a set of records for two tables, where all rows of the "left" table are enlisted with all rows of the "right" table, even if the join condition does not find any matching row on the "left" or on the "right" table.
n
(databases) A single authoritative record on an individual customer etc. that draws from various other data sources.
n
(computing) A text editor that allows for manipulation of the fundamental binary data that constitutes a computer file, displayed in hexadecimal format.
n
(databases) A database whose records are linked in a tree-like structure, each child record having a single primary parent.
n
(databases) An instruction to the database engine as to how a query should be executed, for example whether to use an index or not.
n
(computing, informal) A person who writes HTML markup.
n
(databases) A kind of database that structures the data by means of hyperlinks.
n
(databases) An index in a hyperbase.
n
(computing) A state of multidimensional interconnections (as in hyperlink or hypertext).
n
(databases) A primary key.
n
(databases, IBM) A backup copy of a database in a format that may be used, along with incremental logs, to recreate the database after a hardware failure
n
(computing, databases) A data structure that improves the performance of operations on a table.
adj
Of or pertaining to information science, the processing of information.
n
(computing, formally) […] the meaning that a human assigns to data by means of the known conventions used in its representation.
n
An abstract but formal representation of entities including their properties, relationships and the operations that can be performed on them.
n
(databases) A join yielding a set of records that combines only the matching records from a set of tables.
n
(software design) The structure and definition of the behavior of a system, the surrounding environment, corresponding artifacts, and the elements that communicate the aforementioned behavior.
adj
(databases) Between more than one query.
adj
(databases) Within a single query.
n
(databases) A database property that determines when and how changes made in one transaction are visible to other concurrent transactions.
n
(computing, databases) An intersection of data in two or more database tables.
n
(databases) In a relational database, a field used as an index into another table (not necessarily unique).
n
(databases) A NoSQL object that includes column families.
n
A database designed to meet the complex storage and retrieval requirements of computerized knowledge management, especially in support of artificial intelligence or expert systems.
n
(information science) A knowledge base with an interlinked graph structure.
n
Alternative spelling of knowledge base [A database designed to meet the complex storage and retrieval requirements of computerized knowledge management, especially in support of artificial intelligence or expert systems.]
n
(databases) Short for left outer join. [(databases) A join yielding a set of records for two tables, where all rows of the "left" table are enlisted with all rows of the "right" table, even if the join condition does not find any matching row on the "right".]
n
(databases) A join yielding a set of records for two tables, where all rows of the "left" table are enlisted with all rows of the "right" table, even if the join condition does not find any matching row on the "right".
n
(computing) A data structure created for the purpose of translating keys into values.
adj
(computing) Having had markup coding added.
n
(data management) Reference data.
n
(data management) A set of processes and tools which centrally and persistently define the non-transactional entities of an organization, with the objective to collect from, and supply to various processes, unique instances of each entity.
n
(more specifically) Large collections of personal data that are gathered and maintained by companies for commercial exploitation.
n
(software, design) Synonym of Event-Driven Architecture
n
(computing) A command that is not part of the language being written but serves as a directive to the interpreter or compiler.
n
(metadata) A central location in an organization where metadata definitions are stored and maintained in a controlled method.
n
(databases) A database that serves to catalogue and classify other databases.
n
(computing) A dataset composed of metadata
n
(computing) A model of the modelling process itself.
n
(specifically) A WHATWG standard for embedding metadata in HTML documents; data encoded in such a way.
n
(software architecture) In software applications using the model-view-controller design pattern, the part or parts of the application that manage the data.
n
(electronics, communication, signal processing, mathematics, software testing) A mathematical and visual method of addressing problems associated with designing complex control, signal processing and communication systems.
n
(software, design) A software design approach for the development of software systems that provides a set of guidelines for the structuring of specifications expressed as models.
n
A computer program or system composed of multiple interacting intelligent agents, capable of solving highly complex problems which are difficult or impossible for an individual agent or monolithic system to solve.
n
(databases) A join between two tables on a field which has the same name.
n
(databases) A unique key formed from attributes that relate to the external world being modelled, rather than being an internally generated surrogate key.
n
(computing, databases) A class of relational database management systems that seek to provide the scalability of NoSQL for online transaction processing (OLTP) read-write workloads while still maintaining the ACID guarantees of a traditional database.
n
(databases) a type of database index that contains a series of sorted pointers pointing to the physical data rows, which are organized either in a heap or in the sort order specified by a clustered index, on the disk
n
(databases) Any of various forms of a relational database providing criteria for determining a table's degree of vulnerability to logical inconsistencies and anomalies.
n
(databases) In relational database design, a process that breaks down data into record groups for efficient processing, by eliminating redundancy.
n
(computing, databases) A broad class of database management systems that differ from traditional relational databases in not using SQL as a primary query language and in omitting some common features to enhance scalability.
n
(databases) A join yielding a set of records that combines every record from a set of tables.
n
(programming, Internet) A fragment of a template containing markup.
n
(computing theory) A data structure consisting of an original document and a series of insertions and deletions referring back to parts of the original or modified document, typically used to represent a series of edit operations on text.
n
(databases) A database query that has parameters which are replaced by values when it is executed, instead of the values being part of the statement itself.
n
(computing, databases) In the design of a database table, the primary key (abbreviated PK) is selected among the non-empty set of candidate keys. The PK is a column (or an irreducible group of columns) able to identify every row of the table.
n
A family of techniques relating the fields of data science and process management to support the analysis of operational processes based on event logs.
n
(databases) A column that yields a value when selected, but is not an actual column of the table.
n
(computing, Internet, Cascading Style Sheets) An object in code that behaves like an HTML element but is not a true element.
n
(programming) A command that resembles, but is not in fact, a machine instruction, such as a special directive or a command that is mapped to a sequence of real instructions.
adj
(databases) Having certain elements of a relational database.
n
(computing, databases) A set of instructions passed to a database.
n
(databases, programming) Any of several generalized computer languages in which users may extract data from selected records in a database
n
(databases) The sequence of steps used to execute a given query in a SQL-based database.
n
(databases) Processing to extract data from a database and present it for use.
n
(programming) In Lisp and related languages, a data structure specifying how text characters are to be interpreted syntactically.
n
Alternative form of recordset [(databases) A data structure consisting of a group of database records.]
n
(databases) A data structure consisting of a group of database records.
n
(data management) Data describing a physical or virtual object and its properties.
n
(databases) A set of ordered tuples retrievable by a relational database; a table.
adj
(databases) Of a database technology using tables and the principles set forth by Dr. Edgar F. Codd. (Contrary to popular notion, "relation" in this context refers to tables, and not linkages.)
n
(databases) A database consisting of separate tables, having explicitly defined relationships, and whose elements may be selectively combined as the results of queries.
n
(databases) A set, often of tabulated data, that is the result of the querying of a database or a similar act.
n
(databases) Short for right outer join. [(databases) A join yielding a set of records for two tables, where all rows of the "right" table are enlisted with all rows of the "left" table, even if the join condition does not find any matching row on the "left".]
n
(databases) A join yielding a set of records for two tables, where all rows of the "right" table are enlisted with all rows of the "left" table, even if the join condition does not find any matching row on the "left".
n
(databases) A point during a transaction at which changes are committed, and to which the user can roll back if necessary.
n
(databases) A formal description of the structure of a database: the names of the tables, the names of the columns of each table, and the data type and other attributes of each column.
n
A computer language designed to be used as part of a larger application.
n
(computing, architecture, rare) A software-architectural approach that is focused on a search engine.
n
(databases) A stage in the normalization of a relational database in which it is in first normal form and every non-key attribute is dependent upon the entire primary key.
v
(databases) To obtain a set of data from a database using a query.
n
(databases) A set of data obtained from a database using a query.
adj
|lang={{#switch:html|js=javascript|py=python|#default={{#ifeq:html||text|html}}}}|style=|inline=inline}} or {{#tag:syntaxhighlight|
n
(databases) A component of a sharded distributed database.
n
(databases) A text or graphical summary of how the system plans to optimize the execution of a query.
adj
(databases) Having the form of a hierarchy, but with some of the intermediate levels omitted.
n
(databases) A proposed operator, for use in database queries, that filters out results that are worse than others according to multiple criteria.
n
(computing) An architect (not to be confused with a designer) of software based on technology, who prepares plans and superintends construction of that software.
n
(software) The set of structures needed to reason about a given software system.
n
(databases, data warehousing) A denormalized database schema consisting of one or more fact tables referencing any number of dimension tables.
n
(databases) A named program or routine stored in a database.
n
(computing, programming) A data structure, especially one that serves to group a number of fields (in contrast to an object-oriented class with methods) or one that is passed by value rather than by reference.
n
(computing, design) A design pattern that makes it easier to create relationships between entities.
n
(programming) a computer language that expresses the presentation of structured documents
n
(web design) A document consisting of markup that describes the layout and presentation to be used when displaying other documents.
v
(databases, transitive) To run a subquery upon.
n
(databases) A select query inside another select query.
n
(databases) A large or composite database.
n
(computing) A directory that contains other directories.
n
(computing) A superdirectory.
n
(databases) Any set of attributes of a relation variable (relvar) that serve to identify a single tuple or row, no other tuple having the same value for every attribute in the set.
n
(Internet) A layer of an HTML frame that has other layers within it
n
(databases) A unique identifier for an entity or object, not derived from application data.
n
(databases) An alternative (often shorter) name defined for an object in a database.
n
(software, system theory) The conceptual model that defines the behavior, structure, and more views of a system.
n
(computing) A range of techniques used especially in commercial computing in which the needs of a company or its staff are analysed and translated into a technical description of the necessary software - which is then created by programmers.
n
Alternative spelling of system architecture [(software, system theory) The conceptual model that defines the behavior, structure, and more views of a system.]
n
(computing) The maintenance of mainframe operating systems
n
(computing, chiefly databases) A lookup table, most often a set of vectors.
n
(databases) A storage location where the actual data underlying the objects in a database can be kept.
n
(computing) A piece of markup representing an element in a markup language.
n
(computing) document template (file with a basic outline for a work)
n
(computing) A data file in a character encoding that allows it to be read in non-specialised text editor.
n
Alternative form of text file [(computing) A data file containing only plain, human-readable text, distinct from documents with embedded formatting]
n
(databases) A stage in the normalization of a relational database in which a database is in second normal form and all non-key attributes are mutually independent (no transient dependencies.)
n
(computing) A concurrency design pattern, where a number of threads are created to perform a number of tasks that are usually organized in a queue.
n
(databases) The ability to access previous states of a database.
n
(data management) Data describing an event (the change as a result of a transaction) and usually described with verbs; it always has a time dimension, a numerical value and refers to one or more objects, on which reference data is kept.
n
(databases) An attribute of a relation that depends on a key but also on a third attribute which is not a key; this is a violation of third normal form.
n
(databases) An SQL procedure that may be initiated when a record is inserted, updated or deleted; typically used to maintain referential integrity.
n
(databases) A database designed for the storage and retrieval of RDF (Resource Description Framework) metadata in the form of triples.
n
(databases) A single row in a relational database.
n
(computing, databases) A text field of indeterminate length in a database, as opposed to the traditional fixed-length field.
n
(databases) An array whose number of elements can vary, up to a pre-defined maximum.
n
(computing, databases) A virtual or logical table composed of the result set of a query in relational databases.
n
(software engineering) A framework that defines a coherent set of views to be used in the construction of an enterprise architecture, software architecture, or system architecture.
n
(databases) A type of database that allows different rows to have arbitrary sets of columns.
n
(software) Microsoft Word, word processor software developed by Microsoft.
n
(databases) A log where all database modifications are stored before they are applied.
n
(databases) The technique of writing all database modifications to a log before they are applied.
n
(surveying) An optimal network design within a computer. It involves choosing an optimal reference system and revolving it around a certain real number.
Note: Concept clusters like the one above are an experimental OneLook
feature. We've grouped words and phrases into thousands of clusters
based on a statistical analysis of how they are used in writing. Some
of the words and concepts may be vulgar or offensive. The names of the
clusters were written automatically and may not precisely describe
every word within the cluster; furthermore, the clusters may be
missing some entries that you'd normally associate with their
names. Click on a word to look it up on OneLook.
Our daily word games Threepeat and Compound Your Joy are going strong. Bookmark and enjoy!
Today's secret word is 10 letters and means "Practical approaches prioritizing results, efficiency." Can you find it?