Content deleted Content added
m Remove stub template(s). Page is start class or higher. Also check for and do General Fixes + Checkwiki fixes using AWB |
No edit summary |
||
Line 2:
In [[algorithms]], '''precomputation''' is the act of performing an initial [[computation]] before [[Run time (program lifecycle phase)|run time]] to generate a [[lookup table]] that can be used by an algorithm to avoid repeated computation each time it is executed. Precomputation is often used in algorithms that depend on the results of expensive computations that don't depend on the input of the algorithm. A trivial example of precomputation is the use of [[hardcoded]] mathematical constants, such as [[Pi|π]] and [[E (mathematical constant)|e]], rather than computing their approximations to the necessary precision at run time.
In [[database]]s, the term '''materialization''' is used as a synonym by some authors.<ref name="Groppe2011">{{cite book|author=Sven Groppe|title=Data Management and Query Processing in Semantic Web Databases|url=http://books.google.com/books?id=HdVZ2MhzP_4C&pg=PA178|date=29 April 2011|publisher=Springer Science & Business Media|isbn=978-3-642-19357-6|page=178}}</ref>
== Overview ==
Line 56 ⟶ 58:
* [[Algorithmic efficiency]]
* [[Partial evaluation]]
* [[materialized view]]
[[Category:Software optimization]]
| |||