Index (information technology)

From Wikipedia, the free encyclopedia

This is referring to Index in the context of Information Technology. For other meanings, see Index.

In computer science, an index can be:

  1. an integer which identifies an array element
  2. a pointer data element
  3. a data structure that enables sublinear-time lookup

When data objects are stored in an array, individual objects are selected by an index which is usually a non-negative scalar integer. Indices are also called subscripts.

Historically, a few programming languages have identified the first element in an array using an index value of 1, but it is common practice in modern languages to identify the first element with an index value of 0. It is also a common syntactic idiom in modern programming languages to use square brackets to contain index values. If the variable sheep identifies an array, in FORTRAN the first sheep would be identified as sheep(1), while many modern computer languages would use sheep[0].

Suppose a data store contains N data objects. A naive algorithm for looking up some particular object will consider each object and will thus, on average, have to examine half (for a successful lookup) or all of them; O(N) or linear time in computer-science terms. Since data stores commonly contain large numbers of objects and since lookup is a common operation, it is often desirable to improve this performance.

An index is any data structure which improves the performance of lookup. There are many different data structures used for this purpose, and in fact a substantial proportion of Computer Science is devoted to the design and analysis of index data structures. There are complex design trade-offs involving lookup performance, index size, and index update performance. Many index designs exhibit logarithmic (O(log(N)) lookup performance and in some applications it is possible to achieve flat (O(1)) performance.

All database software includes indexing technology in the interests of improving performance. See Index (database).

One specific and very common application is in the domain of information retrieval, where the application of a full-text index enables rapid identification of documents based on their textual content.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.