Search results
Jump to navigation
Jump to search
- ...section 5.10</ref> This can be calculated when two [[database]] [[Table (database)|tables]] are to be [[Join (SQL)|joined]]. It is primarily concerned with [ [[Category:Database algorithms]] ...554 bytes (70 words) - 12:19, 27 January 2023
- ...rrency control''' is a [[concurrency control]] method used in [[relational database]]s without using [[lock (computer science)|locking]]. ...+control%22+-wikipedia&pg=PA330&printsec=frontcover |title=Introduction to Database Systems |date=September 2010 |publisher=Pearson Education India |isbn=978-8 ...1 KB (141 words) - 17:44, 13 June 2025
- ...ion+retrieval/book/978-3-540-42289-1]</ref> Unlike traditional data mining algorithms, which look for relational data mining algorithms look for patterns among multiple tables ...3 KB (395 words) - 19:43, 25 June 2025
- {{Short description|Digital image used to test image algorithms}} ...4.1.07.tiff|right|thumb|Test image of jelly beans from the USC-SIPI image database]] ...3 KB (465 words) - 05:44, 29 April 2025
- | title = Algorithms | abbreviation = Algorithms ...4 KB (451 words) - 12:25, 14 March 2025
- ...use to develop various algorithms and report results. The use of a common database also allowed one to compare the effectiveness of different approaches in me ...df.cfm?pub_id=900863 The FERET Evaluation Methodology for Face-recognition Algorithms]". ''NISTIR 6264 and IEEE Trans. Pattern Analysis and Machine Intelligence' ...3 KB (446 words) - 06:49, 14 April 2024
- ...| first2=Michael | last3=Hamilton | first3=James | title=Architecture of a database system | publisher=Now | publication-place=Boston | date=2007 | isbn=978-1- ...st be written to [[stable storage]], before the changes are written to the database.<ref>{{Cite web |date=2023-05-11 |title=30.3. Write-Ahead Logging (WAL) |ur ...4 KB (563 words) - 14:56, 23 June 2025
- ...re historically more related to computer science (e.g. data structures and algorithms), and other to computer engineering (e.g. computer architecture). CSE is al ...nics]], [[digital logic]] and design, [[software engineering]], [[database|database systems]] and core subjects of theoretical computer science such as [[theor ...4 KB (452 words) - 16:02, 26 June 2025
- {{short description|History of actions executed by a database management system}} ...ures. Physically, a log is a [[computer file|file]] listing changes to the database, stored in a stable storage format. ...6 KB (825 words) - 05:09, 18 July 2022
- ...l [[epitope]] identification by means of database searching with dedicated algorithms, studies on toxicity of fractions of gluten and/or gluten-like proteins, de ...838 bytes (114 words) - 07:29, 3 September 2017
- * [[Schema (genetic algorithms)]], a set of programs or bit strings that have some genotypic similarity * [[Database schema]] ...1 KB (138 words) - 11:04, 19 November 2023
- ...to determine [[association rules]] which highlight general trends in the [[database]]: this has applications in domains such as [[market basket analysis]]. ...item sets which are subsets of at least <math>C</math> transactions in the database. ...10 KB (1,444 words) - 14:04, 16 April 2025
- ...the [[Association for Computing Machinery]] [[Special Interest Group]] on Algorithms and Computation Theory, whose purpose is support of research in [[theoretic *PODS: ACM [[Symposium on Principles of Database Systems]] (jointly sponsored by [[SIGAI]] and [[SIGACT]]) ...4 KB (557 words) - 13:15, 25 November 2023
- *[[Davies–Bouldin index]], a metric for evaluating clustering algorithms *[[Perl DBI]], a database interface for Perl ...1 KB (151 words) - 17:09, 17 September 2021
- ...ohan|Chandrasekaran Mohan]] is the primary inventor of the ARIES family of algorithms.<ref>{{cite web|title=Repeating History Beyond ARIES|url=http://www.vldb.or * [[Write-ahead logging]]: Any change to an object is first recorded in the [[database log|log]], and the log must be written to stable storage before changes to ...8 KB (1,380 words) - 19:41, 9 December 2024
- ...eley.edu/~cs266/sp10/readings/smith78.pdf Sequentiality and Prefetching in Database Systems]. ACM TOS</ref><ref>''Hyong Shim et al.'' [http://0b4af6cdc2f0c5998 ...orithms are impractical without [[random access]]. On the other hand, some algorithms, typically those that do not have index, require only sequential access, su ...4 KB (593 words) - 09:16, 7 February 2025
- # [[Relational database]]s ==A taxonomy of metadata matching algorithms== ...5 KB (755 words) - 08:49, 5 June 2025
- ...ty (computer science) | durability]] (two of the [[ACID]] properties) in [[database system]]s. A ''page'' in this context refers to a unit of physical storage ...ld master–new master''' batch processing technique used in mainframe database systems. In these systems, the output of each batch run (possibly a day's ...2 KB (357 words) - 17:16, 4 November 2024
- * ''[[Introduction to Algorithms]]'' by Cormen, Leiserson, and Rivest, nicknamed for its authors' initials ...tion Log Record, a type of [[Transaction log#Types of database log records|database log record]] ...2 KB (255 words) - 19:57, 19 February 2025
- A '''nested transaction''' is a [[database transaction]] that is started by an instruction within the scope of an alre ...t the programmer knowing it. A component function may or may not contain a database transaction (this is the encapsulated secret of the component. See [[Inform ...3 KB (422 words) - 06:00, 18 December 2019