Difference between revisions of "Data"

From Chessprogramming wiki
Jump to: navigation, search
 
(4 intermediate revisions by the same user not shown)
Line 107: Line 107:
 
==2000 ...==
 
==2000 ...==
 
* [[Julio César Hernández-Castro]], [[Ignacio Blasco-López]], [[L.Javier Garcéa-Villalba]] ('''2004'''). ''Hiding Data in Games''. [[ICGA Journal#27_2|ICGA Journal, Vol. 27, No. 2]]
 
* [[Julio César Hernández-Castro]], [[Ignacio Blasco-López]], [[L.Javier Garcéa-Villalba]] ('''2004'''). ''Hiding Data in Games''. [[ICGA Journal#27_2|ICGA Journal, Vol. 27, No. 2]]
 +
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=56337 Dominique Duval], [https://dblp.uni-trier.de/pers/hd/e/Echahed:Rachid Rachid Echahed], [[Frédéric Prost]] ('''2005'''). ''Data-Structure Rewriting''. [https://arxiv.org/abs/cs/0503065 arXiv:cs/0503065]
 
* [[Julio César Hernández-Castro]], [[Ignacio Blasco-López]], [[Juan M. Estevez-Tapiador]], [[Arturo Ribagorda-Garnacho]] ('''2006'''). ''Steganography in games: A general methodology and its application to the game of Go''. [http://www.journals.elsevier.com/computers-and-security/ Computers & Security], Vol. 25, [http://www.azlaha.com/stegogo.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Steganography steganography from Wikipedia]</ref>
 
* [[Julio César Hernández-Castro]], [[Ignacio Blasco-López]], [[Juan M. Estevez-Tapiador]], [[Arturo Ribagorda-Garnacho]] ('''2006'''). ''Steganography in games: A general methodology and its application to the game of Go''. [http://www.journals.elsevier.com/computers-and-security/ Computers & Security], Vol. 25, [http://www.azlaha.com/stegogo.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Steganography steganography from Wikipedia]</ref>
 
* [[Erik D. Demaine]], [[Mathematician#DHarmon|Dion Harmon]], [[Mathematician#JIacono|John Iacono]], [[Mathematician#MPatrascu|Mihai Pătrașcu]] ('''2007'''). ''[http://erikdemaine.org/papers/Tango_SICOMP/ Dynamic Optimality—Almost]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 37, No. 1 <ref>[https://en.wikipedia.org/wiki/Tango_tree Tango tree from Wikipedia]</ref>
 
* [[Erik D. Demaine]], [[Mathematician#DHarmon|Dion Harmon]], [[Mathematician#JIacono|John Iacono]], [[Mathematician#MPatrascu|Mihai Pătrașcu]] ('''2007'''). ''[http://erikdemaine.org/papers/Tango_SICOMP/ Dynamic Optimality—Almost]''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 37, No. 1 <ref>[https://en.wikipedia.org/wiki/Tango_tree Tango tree from Wikipedia]</ref>
 
* [http://ozark.hendrix.edu/%7Eburch/ Carl Burch], ''[http://www.toves.org/books/data/index.html Data & Procedure]''. On-line Book
 
* [http://ozark.hendrix.edu/%7Eburch/ Carl Burch], ''[http://www.toves.org/books/data/index.html Data & Procedure]''. On-line Book
 
* [[Mathematician#KMehlhorn|Kurt Mehlhorn]], [[Peter Sanders]] ('''2008'''). ''[http://www.mpi-inf.mpg.de/~mehlhorn/Toolbox.html Data Structures and Algorithms: The Basic Toolbox]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], ISBN 978-3540779773
 
* [[Mathematician#KMehlhorn|Kurt Mehlhorn]], [[Peter Sanders]] ('''2008'''). ''[http://www.mpi-inf.mpg.de/~mehlhorn/Toolbox.html Data Structures and Algorithms: The Basic Toolbox]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], ISBN 978-3540779773
* [[Denis Xavier Charles]], [[Kumar Chellapilla]] ('''2008'''). ''[http://arxiv.org/abs/0807.0928 Bloomier Filters: A Second Look]''. [http://www.informatik.uni-trier.de/%7Eley/db/conf/esa/esa2008.html#CharlesC08 ESA 2008] <ref>[https://en.wikipedia.org/wiki/Bloom_filter#Bloomier_filters Bloom filter - Bloomier filters from Wikipedia]</ref>
+
* [[Mathematician#DXCharles|Denis Xavier Charles]], [[Kumar Chellapilla]] ('''2008'''). ''[http://arxiv.org/abs/0807.0928 Bloomier Filters: A Second Look]''. [http://www.informatik.uni-trier.de/%7Eley/db/conf/esa/esa2008.html#CharlesC08 ESA 2008] <ref>[https://en.wikipedia.org/wiki/Bloom_filter#Bloomier_filters Bloom filter - Bloomier filters from Wikipedia]</ref>
 
* [[Anthony Cozzie]], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/s/Stratton:Frank.html Frank Stratton], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/x/Xue:Hui.html Hui Xue], [http://spqr.cs.umass.edu/events/2011-king-sam/ Samuel T. King] ('''2008'''). ''Digging for Data Structures''. [http://www.informatik.uni-trier.de/~ley/db/conf/osdi/osdi2008.html#CozzieSXK08 OSDI 2008], [http://www.usenix.org/event/osdi08/tech/full_papers/cozzie/cozzie.pdf pdf]
 
* [[Anthony Cozzie]], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/s/Stratton:Frank.html Frank Stratton], [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/x/Xue:Hui.html Hui Xue], [http://spqr.cs.umass.edu/events/2011-king-sam/ Samuel T. King] ('''2008'''). ''Digging for Data Structures''. [http://www.informatik.uni-trier.de/~ley/db/conf/osdi/osdi2008.html#CozzieSXK08 OSDI 2008], [http://www.usenix.org/event/osdi08/tech/full_papers/cozzie/cozzie.pdf pdf]
 +
* [[Mathematician#BHaeupler|Bernhard Haeupler]], [[Siddhartha Sen]], [[Mathematician#RETarjan|Robert Tarjan]] ('''2009'''). ''Heaps Simplified''. [https://arxiv.org/abs/0903.0116 arXiv:0903.0116]
 +
* [[Mathematician#BHaeupler|Bernhard Haeupler]], [[Siddhartha Sen]], [[Mathematician#RETarjan|Robert Tarjan]] ('''2009'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-03367-4_31 Rank-Balanced Trees]''. [https://dblp.org/db/conf/wads/wads2009.html#HaeuplerST09 WADS 2009]
 +
* [[Mathematician#BHaeupler|Bernhard Haeupler]], [[Siddhartha Sen]], [[Mathematician#RETarjan|Robert Tarjan]] ('''2009'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-04128-0_59 Rank-Pairing Heaps]''. [https://dblp.org/db/conf/esa/esa2009.html#HaeuplerST09 ESA 2009]
 
* [http://csl.ira.uka.de/~felix/ Felix Putze], [[Peter Sanders]], [http://algo2.iti.kit.edu/english/singler.php Johannes Singler] ('''2009'''). ''Cache-, hash-, and space-efficient bloom filters''. [[ACM#JEA|ACM Journal of Experimental Algorithmics]] Vol. 14
 
* [http://csl.ira.uka.de/~felix/ Felix Putze], [[Peter Sanders]], [http://algo2.iti.kit.edu/english/singler.php Johannes Singler] ('''2009'''). ''Cache-, hash-, and space-efficient bloom filters''. [[ACM#JEA|ACM Journal of Experimental Algorithmics]] Vol. 14
 +
* [https://dblp.uni-trier.de/pers/hd/h/Hall:Mark_A= Mark A. Hall], [https://dblp.uni-trier.de/pers/hd/f/Frank:Eibe Eibe Frank], [[Geoffrey Holmes]], [[Bernhard Pfahringer]], [https://dblp.uni-trier.de/pers/hd/r/Reutemann:Peter Peter Reutemann], [[Ian H. Witten]] ('''2009'''). ''The WEKA data mining software: an update''. [https://dblp.uni-trier.de/db/journals/sigkdd/sigkdd11.html SIGKDD Explorations], Vol. 11, No. 1, [https://www.kdd.org/exploration_files/p2V11n1.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Weka_(machine_learning) Weka (machine learning) from Wikipedia]</ref>
 
==2010 ...==
 
==2010 ...==
 +
* [https://dblp.uni-trier.de/pers/hd/f/Frank:Eibe Eibe Frank], [https://dblp.uni-trier.de/pers/hd/h/Hall:Mark_A= Mark A. Hall], [[Geoffrey Holmes]], [https://dblp.uni-trier.de/pers/hd/k/Kirkby:Richard Richard Kirkby], [[Bernhard Pfahringer]], [[Ian H. Witten]], [https://dblp.uni-trier.de/pers/hd/t/Trigg:Leonard_E= Len Trigg]  ('''2010'''). ''[https://link.springer.com/chapter/10.1007/978-0-387-09823-4_66 Weka-A Machine Learning Workbench for Data Mining]''. [https://link.springer.com/book/10.1007/978-0-387-09823-4 Data Mining and Knowledge Discovery Handbook], [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
 
* [[Erik D. Demaine]], [[Mathematician#JIacono|John Iacono]], [[Stefan Langerman]], [[Mathematician#OOzkan|Özgür Özkan]] ('''2013'''). ''Combining Binary Search Trees''. [https://arxiv.org/abs/1304.7604 arXiv:1304.7604]
 
* [[Erik D. Demaine]], [[Mathematician#JIacono|John Iacono]], [[Stefan Langerman]], [[Mathematician#OOzkan|Özgür Özkan]] ('''2013'''). ''Combining Binary Search Trees''. [https://arxiv.org/abs/1304.7604 arXiv:1304.7604]
 +
* [[Mathematician#BHaeupler|Bernhard Haeupler]], [[Siddhartha Sen]], [[Mathematician#RETarjan|Robert Tarjan]] ('''2015'''). ''[https://dl.acm.org/doi/10.1145/2689412 Rank-Balanced Trees]''. [[ACM#TALG|ACM Transactions on Algorithms]], Vol. 11, No. 4
 +
* [[Ian H. Witten]], [https://dblp.uni-trier.de/pers/hd/f/Frank:Eibe Eibe Frank], [https://dblp.uni-trier.de/pers/hd/h/Hall:Mark_A= Mark A. Hall], [http://www.professeurs.polymtl.ca/christopher.pal/ Christopher Pal] ('''2016'''). ''[https://www.cs.waikato.ac.nz/~ml/weka/book.html Data Mining: Practical Machine Learning Tools and Techniques]''. 4th Edition, [https://en.wikipedia.org/wiki/Morgan_Kaufmann_Publishers Morgan Kaufmann]
 +
* [[David Eppstein]] ('''2016'''). ''Cuckoo Filter: Simplification and Analysis''. [https://arxiv.org/abs/1604.06067 arXiv:1604.06067] <ref>[https://en.wikipedia.org/wiki/Cuckoo_filter Cuckoo filter from Wikipedia]</ref>
 
* [[Erik D. Demaine]], [[Mathematician#JIacono|John Iacono]], [https://dblp.uni-trier.de/pers/hd/k/Koumoutsos:Grigorios Grigorios Koumoutsos], [[Stefan Langerman]] ('''2019'''). ''Belga B-trees''. [http://export.arxiv.org/abs/1903.03560 arXiv:1903.03560]
 
* [[Erik D. Demaine]], [[Mathematician#JIacono|John Iacono]], [https://dblp.uni-trier.de/pers/hd/k/Koumoutsos:Grigorios Grigorios Koumoutsos], [[Stefan Langerman]] ('''2019'''). ''Belga B-trees''. [http://export.arxiv.org/abs/1903.03560 arXiv:1903.03560]
  
Line 145: Line 154:
  
 
'''[[Programming|Up one Level]]'''
 
'''[[Programming|Up one Level]]'''
 +
[[Category:Film]]

Latest revision as of 23:15, 8 December 2020

Home * Programming * Data

Data is anything in a form suitable for use with a computer to represent information or knowledge. Bits, bytes, characters, strings, numbers, codes, sets, sequences and structures, as well as references (pointers, addresses) to related data, retrievable stored in memory of any kind of hardware.

A variable in the context of programming languages, associates a symbolic name with a memory address.

Processor's View

From processor's point of view, an atomic fixed sized data item with a unique memory address is a primitive data item, today usually with a size of one, two, four, or up to eight bytes, sometimes even 16 or 32 bytes. One of these data items may represent numbers in various formats and value ranges, finite sets, codes like a character of a text or a piece on the chessboard, or even instruction codes and memory addresses. It fits into one processor register and is subject of arithmetical or logical operations, or, if interpreted as (part of an) address, to perform random memory access, that is to store and retrieve primitive data items. Program code is decoded and interpreted as instruction to control the combinatorial and sequential logic while executing a program within its processor, usually distinct from application specific data, if the application is not an assembler, compiler or debugger or anything related to self-modifying code or self-replication [2] .

A collection of primitive data types, located consecutively in memory may be accessed relative to the address of its first element via another data item, an index, or - specially if the primitive data items have different sizes, via constant offsets. From machine perspective, this covers array (vector) and structure, while the latter may be interpreted as concrete implementation of abstract objects.

Lifetime of Data

Data may resist in persistent non-volatile memory or volatile random-access memory. The lifetime of volatile data depends on the data declaration of various programming languages, in C related to storage class specifiers [3] .

Static Data

Global or static data as determined and may be initialized at compile time requires static memory allocation. Static data resides in an object file or in segmentated memory in a data- or bss-segment, dependent on their initialization. For instance, some chess programs keep material- and other lookup tables initialized in their object file and data segment, for huge tables likely by generated source code with appropriate data declarations and static initialization. Assuming the initialization code is (much) shorter than the generated data, others prefer to reduce the size of the object file to initialize stuff located in the bss-segment or elsewhere after program startup.

Dynamic Data

Dynamic data is created during the runtime of a process, it might be allocated from a memory pool (heap), and freed if no longer needed, depending on the framework or programming languages, either explicitly, or implicitly by garbage collection.

Automatic Data

Automatic data and variables like local variables and actual parameters have a limited lifetime inside the scope of a subroutine or block. Automatic variables either reside on the processor stack, or inside a processor register.

Algorithms + Data

Data structures are inherently related to algorithms and their efficiency, as for instance elaborated by Niklaus Wirth in Algorithms + Data Structures = Programs [4] .

Primitive Types

General Purpose

Chess Specific

Scalar integers as numbers, enumerations or simple structures related to Chess and Search basics.

Encoding Moves
Ply
Centipawns
Millipawns

Structured Data

General Purpose

Chess Specific

Persistent Data

Endianness

See also

Publications

1960 ...

1970 ...

1980 ...

1990 ...

2000 ...

2010 ...

External Links

References

Up one Level