Being in such a position that top and bottom are reversed; SYN. upside-down.

Množina: inverted commas

Chiefly British; quotation mark

Singular of inverted commas is inverted comma.

Another term for quotation marks.

Množina: inverted files

See inverted list.
In computing, a file that reorganizes the structure of an existing data file to enable a rapid search to be made for all records having one field falling within set limits.
For example, a file used by an estate agent might store records on each house for sale, using a reference number as the key field for sorting. One field in each record would be the asking price of the house. To speed up the process of drawing up lists of houses falling within certain price ranges, an inverted file might be created in which the records are rearranged according to price. Each record would consist of an asking price, followed by the reference numbers of all the houses offered for sale at this approximate price.

Množina: inverted lists

A method for creating alternative locators for sets of information. For example, in a file containing data about cars, records 3, 7, 19, 24, and 32 might contain the value “Red” in the field COLOR. An inverted list (or index) on the field COLOR would contain a record for “Red” followed by the locator numbers 3, 7, 19, 24, and 32. See also field, record. Compare linked list.

Množina: inverted pleats

A box pleat reversed so that the fullness is turned inward.

Množina: inverted structures

A file structure in which record keys are stored and manipulated separately from the records themselves.

Množina: inverted sugars

Množina: inverted-list databases

A database similar to a relational database but with several differences that make it much more difficult for the database management system to ensure data consistency, integrity, and security than with a relational system. The rows (records or tuples) of an inverted-list table are ordered in a specific physical sequence, independent of any orderings that may be imposed by means of indexes. The total database can also be ordered, with specified logical merge criteria being imposed between tables. Any number of search keys, either simple or composite, can be defined. Unlike the keys of a relational system, these search keys are arbitrary fields or combinations of fields. No integrity or uniqueness constraints are enforced; neither the indexes nor the tables are transparent to the user. Compare relational database.