I propose this page be moved to "Database index", to avoid the awkward parenthesized subject and because this is a familiar enough unambiguous term. Consent/dis
| This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||
| |||||||||||||||||||||
| Text or other creative content from this version of Index (computer science) was copied or moved into Index (database) with this edit on 15:37, 11 January 2012. The former page's history now serves to provide attribution for that content in the latter page, and it must not be deleted as long as the latter page exists. |
I propose this page be moved to "Database index", to avoid the awkward parenthesized subject and because this is a familiar enough unambiguous term. Consent/dissent? Deco 22:18, 9 August 2005 (UTC)
Ok I'm an expert, what is wrong with this article? I'm going to remove the expert tag and I hope that anyone who puts it back can leave a note as to what is wrong so it can be corrected. Triddle 14:07, 8 October 2005 (UTC)
(Can you tell I've had more than a few questions about these lately?)
Dunno if I inadvertently missed some of these topics. --Rob 23:35, 26 October 2005 (UTC)
May I also suggest that we at least mention the reason for using'indexes' vs. 'indices'. Though perhaps a minor linguistics/usage distinction, it comes up in IT dept. discussions and matters for things like keyword searches. Rob uses 'indices' in this discussion area, for example, but the entry itself always uses 'indexes'. -- jorvis
I'd also like to suggest that there be some diagrams to accompany examples. — Preceding unsigned comment added by 69.143.93.39 (talk) 16:45, 3 November 2013 (UTC)
The current content of Bitmap index is sparse and much of the page space is occupied by an illustrative data grid. The content would/could appropriately sit as a section of this article; if expansion takes place, Template:main could be used to cross-reference, a solution I prefer over a bare see-also link (currently included here). --User:Ceyockey (talk to me) 19:01, 21 December 2006 (UTC)
The bitmap index article can remain mostly as is, but the In-memory bitmaps section should probably be documented here, because it's an access strategy for any kind of index, not an index storage format. But currently there's nowhere to put it, until this article doesn't document other access strategies. -- intgr [talk] 06:38, 13 October 2009 (UTC)
The article dense index was created earlier today (21 Dec) and is not wikified or categorized. It seems that the content would make a reasonable section in this article, better than a stand alone stub article awaiting clean-up. Regards --User:Ceyockey (talk to me) 19:04, 21 December 2006 (UTC)
Testing to see if i should trust the in for on wikepia. Denecia —Preceding unsigned comment added by 190.59.154.206 (talk) 00:08, 11 March 2010 (UTC)
yes, it'll be nice to merge the dense index and sparse index into this one. we could also add a picture like this one : http://www.e-student.si/data/thumb/6/69/Indeksi_gostota.png/500px-Indeksi_gostota.png to ilusstrate the meaning of both. Stdazi 14:32, 15 April 2007 (UTC)
I'm a bit disappointed that this article contains no information on the actual structure and implementation of database indexes, which is a deep but accessible subject. I'll look at adding this unless it's hiding someplace else. Dcoetzee 20:13, 11 May 2007 (UTC)
Yes it does, without an example just blabbers some stuff useless. I will get back to fix it.
HOW COME??? this article uses the terminology TABLE when referring to databases? Indexed Databases are just as easily made of FILES/RECORDS/FIELDS as they are TABLES/ROWS/COLUMNS. My RELATIONAL, ISAM/NoSQL/Embedded Perl Databases are composed of (1) Fixed-length record (no CR/LF) Flat File (.dat extension) databases containing text fields, (2) indexed by binary SDBM files (.pag & .dir file extensions) databases of key/values pairs (tied to program hash tables), for persistent, instantaneous, random access indexing, where the KEY is one or more fields and or partial fields contained within the Flat File records, and the VALUE is the byte offset location of the record relative to either TOP OF FILE (positive integer to 2 Gigabytes) or END OF FILE (negative integer to 2 Gigabytes). The byte offset is used for setting the FILE POINTER before performing READ/WRITE operations. Supported with the "public domain" SDBM databases are: Unique Primary Keys, Unique Alternate Keys, and Alternate Keys with Duplicates. --Anonymous
The article currently describes "clusterED" indexes where I believe that the right term would be "clusterING" indexes: There doesn't have to be anything special about the clustering index inself, but it is affecting how table data should be stored. Thus, clusterING is more appropriate.
Also, the "clusterING" term is used in the following publications, all of which are rather notable database resources:
Troels Arvin (talk) 22:58, 22 February 2009 (UTC)
Dictionary.com lists the plural form of index as either indexes or indices. I see this article uses both. I think that one form or the other needs to be picked and used exclusively. Might even be worth noting the multiple plural forms.—NMajdan•talk 14:42, 12 October 2009 (UTC)
--222.64.22.74 (talk) 02:26, 8 April 2010 (UTC)
Mainfile does NOT to be sorted ... (Ullman, Principles of Database Systems) —Preceding unsigned comment added by 92.193.5.33 (talk) 10:38, 20 November 2010 (UTC) --41.238.77.233 (talk) 23:42, 16 April 2012 (UTC)--41.238.77.233 (talk) 23:42, 16 April 2012 (UTC)
Sorry for my english. Why this article says nothing about practical limitations of the indices implementations? For example is it possible to index the string fields with varying length? What the limit if yes? If i have field with a string say 65536 unicode symbols length, will be it indexable practically? And how about arbitrary binary data? Are they indexable ever? And if i have the table with 100 fields, may i create the index for each field. Do expose dbms any limit on this? And although this is not about the indices directly, but is highly related, suppose the query asks dbms for something with 'where fx="blagjptmjgdaj"' and fx is non-indexed, what behavior of dbms is? Linear fullsearch with implicit creating of the indexon this field or whithout or anything else? And so forth. Idea for speeding up the location of records by B+ tree indices is understandable in principle, but it is very desirable, that this article also would mention those complications and their solutions in real indexing systems. Maybe some expert, who understood my writings, have the time and willing, will add about this. I think it will be very useful. 77.52.154.70 (talk) 08:26, 14 May 2013 (UTC)
Link to Finnish article should be removed, because the article is about subject headings, not computers. — Preceding unsigned comment added by 195.148.239.230 (talk) 10:54, 27 August 2014 (UTC)
I noticed that https://en.wikipedia.org/wiki/Key had a link to Key (computing), which redirects to this wikipedia entry. But the second paragraph in this entry said: "An index is a copy of selected columns of data from a table, called a database key or simply key, that can be searched very efficiently", which is a VERY misleading definition of "key". I have changed that text and the link on the Key page, but the redirection from https://en.wikipedia.org/wiki/Key_(computing) should go to https://en.wikipedia.org/wiki/Unique_key -- NOT https://en.wikipedia.org/wiki/Database_index -- and I don't know how to fix that. Can someone help with that? -- DBooth (talk) 20:14, 5 February 2021 (UTC)
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.