ΠΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΠ΅ ΠΏΡΠ΅ΡΠΈΠΊΡΠ½ΡΡ Π΄Π΅ΡΠ΅Π²ΡΠ΅Π² ΠΏΡΠΈ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΠΈ ΡΠΈΡΡΠ΅ΠΌ Π°Π½Π°Π»ΠΈΠ·Π° Π΄Π°Π½Π½ΡΡ
ΠΡΠΎΠ±Π»Π΅ΠΌΠ° ΠΏΡΠΎΡΠΌΠΎΡΡΠ° Π½Π°ΠΉΠ΄Π΅Π½Π½ΡΡ Π°ΡΡΠΎΡΠΈΠ°ΡΠΈΠ²Π½ΡΡ ΠΏΡΠ°Π²ΠΈΠ» ΡΠ²Π»ΡΠ΅ΡΡΡ Π°ΠΊΡΡΠ°Π»ΡΠ½ΠΎΠΉ ΠΈΠ·-Π·Π° Π±ΠΎΠ»ΡΡΠΎΠ³ΠΎ ΠΊΠΎΠ»ΠΈΡΠ΅ΡΡΠ²Π° ΠΎΠ±ΡΡΠ½ΠΎ ΠΏΠΎΠ»ΡΡΠ°Π΅ΠΌΡΡ ΠΏΡΠ°Π²ΠΈΠ». Π Π»ΠΈΡΠ΅ΡΠ°ΡΡΡΠ΅ Π±ΡΠ»ΠΈ ΠΏΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½Ρ Π΄Π²Π΅ ΠΎΡΠ½ΠΎΠ²Π½ΡΡ Π³ΡΡΠΏΠΏΡ ΠΌΠ΅ΡΠΎΠ΄ΠΎΠ²: ΠΎΡΡΠ΅ΡΠ΅Π½ΠΈΠ΅ ΠΏΠΎ ΠΌΠ΅ΡΠ°ΠΌ ΠΈΠ½ΡΠ΅ΡΠ΅ΡΠ° ΠΈ ΡΠΈΠ½ΡΠ°ΠΊΡΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΠΎΠ³ΡΠ°Π½ΠΈΡΠ΅Π½ΠΈΡ. Π‘ΡΠ΅Π΄ΠΈ ΠΌΠ΅Ρ ΠΈΠ½ΡΠ΅ΡΠ΅ΡΠ° Π² ΠΎΡΠ½ΠΎΠ²Π½ΠΎΠΌ ΡΠ°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°Π»ΠΈΡΡ ΠΌΠ΅ΡΡ, Π½Π΅ ΡΡΠΈΡΡΠ²Π°ΡΡΠΈΠ΅ ΡΠΎΡΡΠ°Π²Π° Π»Π΅Π²ΠΎΠΉ ΡΠ°ΡΡΠΈ ΠΏΡΠ°Π²ΠΈΠ»Π°. Π ΡΠ°Π±ΠΎΡΠ΅ ΠΏΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½ ΡΡΠ΄ ΠΌΠ΅Ρ, ΡΡΠΈΡΡΠ²Π°ΡΡΠΈΡ ΡΠΎΡΡΠ°Π² Π»Π΅Π²ΠΎΠΉ ΡΠ°ΡΡΠΈ… Π§ΠΈΡΠ°ΡΡ Π΅ΡΡ >
Π‘ΠΏΠΈΡΠΎΠΊ Π»ΠΈΡΠ΅ΡΠ°ΡΡΡΡ
- ΠΠΎΠ½Π΄Π°ΡΠ΅Π½ΠΊΠΎ Π.Π., ΠΠ°Π»Π°ΠΊΡΠΈΠΎΠ½ΠΎΠ² Π. Π., ΠΠΎΡΠ΅ΠΌΡΡΠΊΠΈΠ½ Π. Π., ΠΡΠ΄ΠΊΠΎΠ² Π. Π‘., Π‘ΡΡΠΈΠΊΠΎΠ²ΡΠΊΠΈΠΉ Π. Π. Π Π΅Π°Π»ΠΈΠ·Π°ΡΠΈΡ ΠΈΠ½ΡΠ΅ΡΠ°ΠΊΡΠΈΠ²Π½ΠΎΠ³ΠΎ Π°Π½Π°Π»ΠΈΠ·Π° Π΄Π°Π½Π½ΡΡ Ρ ΠΏΠΎΠΌΠΎΡΡΡ ΠΏΡΠ΅ΡΠΈΠΊΡΠ½ΠΎΠ³ΠΎ Π΄Π΅ΡΠ΅Π²Π°: ΠΡΠ΅ΠΏΡΠΈΠ½Ρ / ΠΠΠ. Π., 2005. — № 61. -34 Ρ.
- ΠΠΎΠ½Π΄Π°ΡΠ΅Π½ΠΊΠΎ Π.Π., ΠΡΠ΄ΠΊΠΎΠ² Π. Π‘. ΠΠ½ΡΠ΅ΡΠ°ΠΊΡΠΈΠ²Π½ΡΠΉ Π°Π½Π°Π»ΠΈΠ· Π°ΡΡΠΎΡΠΈΠ°ΡΠΈΠ²Π½ΡΡ ΠΏΡΠ°Π²ΠΈΠ» Π² Π±Π°Π·Π΅ Π΄Π°Π½Π½ΡΡ . // ΠΠ΅ΡΡΠ½ΠΈΠΊ ΠΊΠΎΠΌΠΏΡΡΡΠ΅ΡΠ½ΡΡ ΠΈ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ ΡΠ΅Ρ Π½ΠΎΠ»ΠΎΠ³ΠΈΠΉ. 2006. — № 10. — Π‘.42−45.
- ΠΠΎΠ½Π΄Π°ΡΠ΅Π½ΠΊΠΎ Π.Π., ΠΡΠ΄ΠΊΠΎΠ² Π. Π‘. ΠΠΎΠΈΡΠΊ ΡΠ°ΡΡΡΡ ΠΈ ΡΠ°Π·Π½ΡΡ ΠΊΠΎΠΌΠ±ΠΈΠ½Π°ΡΠΈΠΉ Ρ ΠΏΠΎΠΌΠΎΡΡΡ ΠΏΠ΅ΡΠ΅ΡΡΡΠΎΠ΅ΠΊ ΠΏΡΠ΅ΡΠΈΠΊΡΠ½ΠΎΠ³ΠΎ Π΄Π΅ΡΠ΅Π²Π°. // ΠΡΠΎΡΠ΅ΡΡΡ ΠΈ ΠΌΠ΅ΡΠΎΠ΄Ρ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΈ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΈ: Π‘Π±.ΡΡ. / ΠΠ€Π’Π. Π., 2006. — Π‘.69−78.
- ΠΡΠ΄ΠΊΠΎΠ² Π.Π‘. ΠΠ³ΡΠ΅Π³ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ ΠΊΡΠ±Π° Ρ ΠΏΠΎΠΌΠΎΡΡΡ ΠΏΡΠ΅ΡΠΈΠΊΡΠ½ΠΎΠ³ΠΎ Π΄Π΅ΡΠ΅Π²Π°. // Π‘ΠΎΠ²ΡΠ΅ΠΌΠ΅Π½Π½ΡΠ΅ ΠΏΡΠΎΠ±Π»Π΅ΠΌΡ ΡΡΠ½Π΄Π°ΠΌΠ΅Π½ΡΠ°Π»ΡΠ½ΡΡ ΠΈ ΠΏΡΠΈΠΊΠ»Π°Π΄Π½ΡΡ Π½Π°ΡΠΊ. Π§Π°ΡΡΡ VII. Π£ΠΏΡΠ°Π²Π»Π΅Π½ΠΈΠ΅ ΠΈ ΠΏΡΠΈΠΊΠ»Π°Π΄Π½Π°Ρ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ°: Π’ΡΡΠ΄Ρ XLVIII Π½Π°ΡΡΠ½ΠΎΠΉ ΠΊΠΎΠ½ΡΠ΅ΡΠ΅Π½ΡΠΈΠΈ. / ΠΠ€Π’Π. Π., 2005. — Π‘.92−93.
- ΠΡΠ΄ΠΊΠΎΠ² Π.Π‘. ΠΠ΅ΡΡ ΠΈΠ½ΡΠ΅ΡΠ΅ΡΠ° Π°ΡΡΠΎΡΠΈΠ°ΡΠΈΠ²Π½ΡΡ ΠΏΡΠ°Π²ΠΈΠ», ΠΎΡΠ½ΠΎΠ²Π°Π½Π½ΡΠ΅ Π½Π° ΠΏΡΠ΅Π΄ΡΠΊΠ°Π·Π°Π½ΠΈΠΈ ΡΠΎΡΠ½ΠΎΡΡΠΈ. // Π‘ΠΎΠ²ΡΠ΅ΠΌΠ΅Π½Π½ΡΠ΅ ΠΏΡΠΎΠ±Π»Π΅ΠΌΡ ΡΡΠ½Π΄Π°ΠΌΠ΅Π½ΡΠ°Π»ΡΠ½ΡΡ ΠΈ ΠΏΡΠΈΠΊΠ»Π°Π΄Π½ΡΡ Π½Π°ΡΠΊ. Π§Π°ΡΡΡ VII. Π£ΠΏΡΠ°Π²Π»Π΅Π½ΠΈΠ΅ ΠΈ ΠΏΡΠΈΠΊΠ»Π°Π΄Π½Π°Ρ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ°: Π’ΡΡΠ΄Ρ XLIX Π½Π°ΡΡΠ½ΠΎΠΉ ΠΊΠΎΠ½ΡΠ΅ΡΠ΅Π½ΡΠΈΠΈ. / ΠΠ€Π’Π. Π., 2006. — Π‘.84−85.
- ΠΡΠ΄ΠΊΠΎΠ² Π.Π‘. ΠΠΎΠΈΡΠΊ ΡΠ°ΡΡΡΡ ΠΊΠΎΠΌΠ±ΠΈΠ½Π°ΡΠΈΠΉ Π² Π±Π°Π·Π°Ρ Π΄Π°Π½Π½ΡΡ . // ΠΠ°ΡΠ΅ΡΠΈΠ°Π»Ρ XIII ΠΠ΅ΠΆΠ΄ΡΠ½Π°ΡΠΎΠ΄Π½ΠΎΠΉ ΠΊΠΎΠ½ΡΠ΅ΡΠ΅Π½ΡΠΈΠΈ ΡΡΡΠ΄Π΅Π½ΡΠΎΠ², Π°ΡΠΏΠΈΡΠ°Π½ΡΠΎΠ² ΠΈ ΠΌΠΎΠ»ΠΎΠ΄ΡΡ ΡΡΡΠ½ΡΡ «ΠΠΎΠΌΠΎΠ½ΠΎΡΠΎΠ²», ΡΠ΅ΠΊΡΠΈΡ «ΠΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½Π°Ρ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ° ΠΈ ΠΊΠΈΠ±Π΅ΡΠ½Π΅ΡΠΈΠΊΠ°». Π., 2006. — Π‘. 19−20.
- ΠΠ»ΡΠΏΠ΅ΡΠΎΠ²ΠΈΡ Π. ΠΠ²Π΅Π΄Π΅Π½ΠΈΠ΅ Π² OLAP ΠΈ ΠΌΠ½ΠΎΠ³ΠΎΠΌΠ΅ΡΠ½ΡΠ΅ Π±Π°Π·Ρ Π΄Π°Π½Π½ΡΡ . // PC Week/RE. 1999. — № 28(202). — Π‘.24. WEB: http://www.olap.ru/basic/alpero2i.asp.
- ΠΡΡΡΡΠ°ΠΌΠΎΠ² Π. ΠΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΠ΅ OLAP ΡΠ΅Ρ Π½ΠΎΠ»ΠΎΠ³ΠΈΠΉ ΠΏΡΠΈ ΠΈΠ·Π²Π»Π΅ΡΠ΅Π½ΠΈΠΈ Π΄Π°Π½Π½ΡΡ . WEB: http://www.basegroup.ru/olap/using.htm.
- ΠΠΈΡΡΠΊΠΎΠ² Π. Π‘ΠΈΡΡΠ΅ΠΌΡ ΠΏΡΠΈΠ½ΡΡΠΈΡ ΡΠ΅ΡΠ΅Π½ΠΈΠΉ ΠΈ Ρ ΡΠ°Π½ΠΈΠ»ΠΈΡΠ° Π΄Π°Π½Π½ΡΡ . // Π‘Π£ΠΠ. 1997. — № 4. — Π‘.37−41.
- ΠΡΡΠΎΠ² Π. ΠΠ±Π½Π°ΡΡΠΆΠ΅Π½ΠΈΠ΅ Π·Π½Π°Π½ΠΈΠΉ Π² Ρ ΡΠ°Π½ΠΈΠ»ΠΈΡΠ°Ρ Π΄Π°Π½Π½ΡΡ . // ΠΡΠΊΡΡΡΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ. 1999. — № 5−6. — Π‘.67−77.
- ΠΠ°ΡΡΠΈΠ°-ΠΠΎΠ»ΠΈΠ½Π° Π., Π£Π»ΡΠΌΠ°Π½ ΠΠΆ., Π£ΠΈΠ΄ΠΎΠΌ ΠΠΆ. Π‘ΠΈΡΡΠ΅ΠΌΡ Π±Π°Π· Π΄Π°Π½Π½ΡΡ . ΠΠΎΠ»Π½ΡΠΉ ΠΊΡΡΡ. ΠΠΎΡΠΊΠ²Π°: ΠΠΈΠ»ΡΡΠΌΠ΅, 2003. — 1088 Ρ.
- ΠΡΠΎ Π. ΠΡΡ ΠΈΡΠ΅ΠΊΡΡΡΡ ΠΎΡΡΡΡΠ½ΠΎΡΡΠΈ. // ΠΡΡΠ½Π°Π» ΠΊΠ»ΡΠ±Π° Π·Π½Π°ΡΠΎΠΊΠΎΠ² DWH, OLAP, XML. 2003. — № 23. WEB: http://www.iso.ru/journal/articles/247.html.
- ΠΡΠΊ Π., Π‘Π°ΠΌΠΎΠΉΠ»Π΅Π½ΠΊΠΎ A. Data Mining: Π£ΡΠ΅Π±Π½ΡΠΉ ΠΊΡΡΡ. Π‘ΠΠ±: ΠΠΈΡΠ΅Ρ, 2001.-366 Ρ.
- ΠΠ°ΡΠ°ΡΡΠΉΡΠ΅Π½ΠΊΠΎ Π. Π‘ΠΎΠ²ΡΠ΅ΠΌΠ΅Π½Π½ΡΠ΅ ΠΏΠΎΠ΄Ρ ΠΎΠ΄Ρ ΠΈ ΠΌΠ΅ΡΠΎΠ΄Ρ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ Π°Π½Π°Π»ΠΈΡΠΈΡΠ΅ΡΠΊΠΈΡ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ ΡΠΈΡΡΠ΅ΠΌ. // Π’Π΅Π·ΠΈΡΡ Π²ΡΡΡΡΠΏΠ»Π΅Π½ΠΈΡ Π½Π° ΡΠ΅ΠΌΠΈΠ½Π°ΡΠ΅ ΠΠ’Π¦ ΠΠ Π «ΠΡΠ°ΠΊΡΠΈΡΠ΅ΡΠΊΠΈΠ΅ Π²ΠΎΠΏΡΠΎΡΡ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΠΎ-Π°Π½Π°Π»ΠΈΡΠΈΡΠ΅ΡΠΊΠΎΠΉ ΡΠ°Π±ΠΎΡΡ Π² ΠΊΠΎΠΌΠΌΠ΅ΡΡΠ΅ΡΠΊΠΎΠΌ Π±Π°Π½ΠΊΠ΅». ΠΠ°ΡΡ 1998.
- ΠΠ°ΡΠ°ΡΡΠΉΡΠ΅Π½ΠΊΠΎ Π. Π€ΠΈΠ»ΠΈΠ°Π»Ρ, Π΄Π°Π½Π½ΡΠ΅, Π°Π½Π°Π»ΠΈΠ·. // ΠΠ°Π½ΠΊΠΎΠ²ΡΠΊΠΈΠ΅ ΡΠ΅Ρ Π½ΠΎΠ»ΠΎΠ³ΠΈΠΈ. 1998.-№ 1.-Π‘.49−52.
- ΠΡΠ·Π½Π΅ΡΠΎΠ² Π‘. Π. ΠΡΠΎΠ΅ΠΊΡΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ ΠΈ ΡΠ°Π·ΡΠ°Π±ΠΎΡΠΊΠ° ΠΊΠΎΡΠΏΠΎΡΠ°ΡΠΈΠ²Π½ΡΡ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ ΡΠΈΡΡΠ΅ΠΌ. WEB: http://www.citforum.ru/cfin/prcorpsys/.
- ΠΡΠ·Π½Π΅ΡΠΎΠ² Π‘.Π., ΠΡΡΠ΅ΠΌΡΠ΅Π² Π. ΠΠ±Π·ΠΎΡ Π²ΠΎΠ·ΠΌΠΎΠΆΠ½ΠΎΡΡΠ΅ΠΉ ΠΏΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΡ Π²Π΅Π΄ΡΡΠΈΡ Π‘Π£ΠΠ Π΄Π»Ρ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ Ρ ΡΠ°Π½ΠΈΠ»ΠΈΡ Π΄Π°Π½Π½ΡΡ (Data Warehouse). // Π’Π΅Π·ΠΈΡΡ Π΄ΠΎΠΊΠ»Π°Π΄Π° Π½Π° 3-ΠΉ Π΅ΠΆΠ΅Π³ΠΎΠ΄Π½ΠΎΠΉ ΠΊΠΎΠ½ΡΠ΅ΡΠ΅Π½ΡΠΈΠΈ «ΠΠΎΡΠΏΠΎΡΠ°ΡΠΈΠ²Π½ΡΠ΅ Π±Π°Π·Ρ Π΄Π°Π½Π½ΡΡ ». ΠΠΎΡΠΊΠ²Π°. — 1998. — Π‘. 153−161.
- ΠΠ°ΡΠΈΠ½ Π‘. ΠΡΠΈΠΌΠ΅Π½Π΅Π½ΠΈΠ΅ Π°ΡΡΠΎΡΠΈΠ°ΡΠΈΠ²Π½ΡΡ ΠΏΡΠ°Π²ΠΈΠ» Π΄Π»Ρ ΡΡΠΈΠΌΡΠ»ΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΏΡΠΎΠ΄Π°ΠΆ. 2003. WEB: www.basegroup.ru/practice/salepromotion.htm.
- ΠΠΈΡΡΠ½ΡΠΊΠΈΠΉ Π. ΠΡΡ ΠΈΡΠ΅ΠΊΡΡΡΠ½ΡΠ΅ ΡΠ΅ΡΠ΅Π½ΠΈΡ ΠΈ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΠΎΠ²Π°Π½ΠΈΠ΅ Π΄Π°Π½Π½ΡΡ Π΄Π»Ρ Ρ ΡΠ°Π½ΠΈΠ»ΠΈΡ ΠΈ Π²ΠΈΡΡΠΈΠ½ Π΄Π°Π½Π½ΡΡ . WEB: www.olap.ru.
- ΠΠΎΠ±Π°Ρ Π. ΠΡΠ½ΠΎΠ²Ρ OLAP. WEB: http://www.softkey.info/reviews/review.php?ID=465.
- ΠΡΠ²ΠΎΠ² Π. Π‘ΠΎΠ·Π΄Π°Π½ΠΈΠ΅ ΡΠΈΡΡΠ΅ΠΌ ΠΏΠΎΠ΄Π΄Π΅ΡΠΆΠΊΠΈ ΠΏΡΠΈΠ½ΡΡΠΈΡ ΡΠ΅ΡΠ΅Π½ΠΈΠΉ Π½Π° ΠΎΡΠ½ΠΎΠ²Π΅ Ρ ΡΠ°Π½ΠΈΠ»ΠΈΡ Π΄Π°Π½Π½ΡΡ . // Π‘Π£ΠΠ. 1997. — № 3. — Π‘.30−40.
- ΠΠ΅ΠΊΠΈΠΏΠ΅Π»ΠΎΠ² Π., Π¨Π°Ρ ΠΈΠ΄ΠΈ Π. ΠΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΡ Π°Π½Π°Π»ΠΈΠ·Π° Π΄Π°Π½Π½ΡΡ . WEB: http://www.basegroup.ru/tech/ontology.htm.
- ΠΠ΅Π΄Π΅ΡΡΠ΅Π½ Π’.Π., ΠΠ΅Π½ΡΠ΅Π½ Π. Π’Π΅Ρ Π½ΠΎΠ»ΠΎΠ³ΠΈΡ ΠΌΠ½ΠΎΠ³ΠΎΠΌΠ΅ΡΠ½ΡΡ Π±Π°Π· Π΄Π°Π½Π½ΡΡ . // ΠΡΠΊΡΡΡΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ. 2002. — № 1. — Π‘.45−50.
- Π‘Π°Ρ Π°ΡΠΎΠ² Π.Π. ΠΠΎΠ½ΡΠ΅ΠΏΡΠΈΡ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ ΠΈ ΡΠ΅Π°Π»ΠΈΠ·Π°ΡΠΈΠΈ ΠΈΠ½ΡΠΎΡΠΌΠ°ΡΠΈΠΎΠ½Π½ΡΡ ΡΠΈΡΡΠ΅ΠΌ, ΠΎΡΠΈΠ΅Π½ΡΠΈΡΠΎΠ²Π°Π½Π½ΡΡ Π½Π° Π°Π½Π°Π»ΠΈΠ· Π΄Π°Π½Π½ΡΡ . // Π‘Π£ΠΠ. 1996. — № 4. -Π‘.55−70.
- Π‘Π°Ρ Π°ΡΠΎΠ² Π.Π. ΠΡΠΈΠ½ΡΠΈΠΏΡ ΠΏΡΠΎΠ΅ΠΊΡΠΈΡΠΎΠ²Π°Π½ΠΈΡ ΠΈ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°Π½ΠΈΡ ΠΌΠ½ΠΎΠ³ΠΎΠΌΠ΅ΡΠ½ΡΡ Π±Π°Π· Π΄Π°Π½Π½ΡΡ (Π½Π° ΠΏΡΠΈΠΌΠ΅ΡΠ΅ Oracle Express Server). // Π‘Π£ΠΠ. 1996. — № 3. — Π‘.44−59.
- Π‘Π»ΠΎΡΠ΅Ρ Π. ΠΡΡ ΠΈΡΠ΅ΠΊΡΡΡΡ OLAP. WEB: www.oIap.ru.
- Π‘ΡΠ°ΡΠΈΠΊΠΎΠ² Π. Π―Π΄ΡΠΎ OLAP ΡΠΈΡΡΠ΅ΠΌΡ. Π§Π°ΡΡΡ 1 ΠΏΡΠΈΠ½ΡΠΈΠΏΡ ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΡ. WEB: http://www.basegroup.ru/olap/corej3artl .htm.
- Π‘ΡΠ°ΡΠΈΠΊΠΎΠ² Π. Π―Π΄ΡΠΎ OLAP ΡΠΈΡΡΠ΅ΠΌΡ. Π§Π°ΡΡΡ 2 Π²Π½ΡΡΡΠΈ Π³ΠΈΠΏΠ΅ΡΠΊΡΠ±Π°. WEB: http://www.basegroup.ru/olap/corepart2.htm.
- Π‘ΡΠ°ΡΠΈΠΊΠΎΠ² Π. Π―Π΄ΡΠΎ OLAP ΡΠΈΡΡΠ΅ΠΌΡ. Π§Π°ΡΡΡ 3 ΠΏΠΎΡΡΡΠΎΠ΅Π½ΠΈΠ΅ ΡΡΠ΅Π·ΠΎΠ² ΠΊΡΠ±Π°. WEB: http://www.basegroup.ru/olap/corepart3.htm.
- Π€Π΅Π΄ΠΎΡΠΎΠ² Π., ΠΠ»ΠΌΠ°Π½ΠΎΠ²Π° Π. ΠΠ²Π΅Π΄Π΅Π½ΠΈΠ΅ Π² OLAP: ΡΠ°ΡΡΡ 1. ΠΡΠ½ΠΎΠ²Ρ OLAP. // ΠΠΎΠΌΠΏΡΡΡΠ΅Ρ ΠΡΠ΅ΡΡ. 2001. — № 4.
- Π€Π΅Π΄ΠΎΡΠΎΠ² Π., ΠΠ»ΠΌΠ°Π½ΠΎΠ²Π° Π. ΠΠ²Π΅Π΄Π΅Π½ΠΈΠ΅ Π² OLAP: ΡΠ°ΡΡΡ 2. Π₯ΡΠ°Π½ΠΈΠ»ΠΈΡΠ° Π΄Π°Π½Π½ΡΡ . // ΠΠΎΠΌΠΏΡΡΡΠ΅Ρ ΠΡΠ΅ΡΡ. 2001. — № 5.
- Π€Π΅Π΄ΠΎΡΠΎΠ² Π., ΠΠ»ΠΌΠ°Π½ΠΎΠ²Π° Π. ΠΠ²Π΅Π΄Π΅Π½ΠΈΠ΅ Π² Π±Π°Π·Ρ Π΄Π°Π½Π½ΡΡ : ΡΡΠ΅Π΄ΡΡΠ²Π° Business Intelligence. // ΠΠΎΠΌΠΏΡΡΡΠ΅Ρ ΠΡΠ΅ΡΡ. 2001. — № 3.
- Π₯ΡΡΡΡΠ°Π»ΡΠ² Π.Π. ΠΠ³ΡΠ΅Π³Π°ΡΠΈΡ Π΄Π°Π½Π½ΡΡ Π² OLAP-ΠΊΡΠ±Π°Ρ . WEB: www.olap.ru.
- Π§Π°ΡΠ΄Ρ ΡΡΠΈ Π‘., ΠΠ°ΠΉΠ°Π» Π£., ΠΠ°ΠΈΡΠΈ Π. Π’Π΅Ρ Π½ΠΎΠ»ΠΎΠ³ΠΈΡ Π±Π°Π· Π΄Π°Π½Π½ΡΡ Π² ΡΠΈΡΡΠ΅ΠΌΠ°Ρ ΠΏΠΎΠ΄Π΄Π΅ΡΠΆΠΊΠΈ ΠΏΡΠΈΠ½ΡΡΠΈΡ ΡΠ΅ΡΠ΅Π½ΠΈΠΉ. // ΠΡΠΊΡΡΡΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ. 2002. — № 1. -Π‘.37−44.
- Π§ΡΠΎ ΡΠ°ΠΊΠΎΠ΅ Data Mining. / Intersoft Lab. // ΠΡΡΠ½Π°Π» ΠΊΠ»ΡΠ±Π° Π·Π½Π°ΡΠΎΠΊΠΎΠ² DWH, OLAP, XML. 2003. — № 26. WEB: http://www.iso.ru/journal/articles/275.html.
- Π¨Π°Ρ ΠΈΠ΄ΠΈ A. Apriori ΠΌΠ°ΡΡΡΠ°Π±ΠΈΡΡΠ΅ΠΌΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ ΠΏΠΎΠΈΡΠΊΠ° Π°ΡΡΠΎΡΠΈΠ°ΡΠΈΠ²Π½ΡΡ ΠΏΡΠ°Π²ΠΈΠ». — 2002. WEB: www.basegroup.ru/rules/apriori.htm.
- Π©Π°Π²Π΅Π»ΡΠ² JT.B. Π‘ΠΏΠΎΡΠΎΠ±Ρ Π°Π½Π°Π»ΠΈΡΠΈΡΠ΅ΡΠΊΠΎΠΉ ΠΎΠ±ΡΠ°Π±ΠΎΡΠΊΠΈ Π΄Π°Π½Π½ΡΡ Π΄Π»Ρ ΠΏΠΎΠ΄Π΄Π΅ΡΠΆΠΊΠΈ ΠΏΡΠΈΠ½ΡΡΠΈΡ ΡΠ΅ΡΠ΅Π½ΠΈΠΉ. // Π‘Π£ΠΠ. 1998. — № 4−5.
- ΠΠ»Π΅ΠΊΡΡΠΎΠ½Π½ΡΠΉ ΡΡΠ΅Π±Π½ΠΈΠΊ ΠΏΠΎ ΡΡΠ°ΡΠΈΡΡΠΈΠΊΠ΅. / StatSoft, Inc. WEB: http://www.statsoft.ru/home/textbook/default.htm.
- Agarwal S., Agrawal R., Deshpande P.M., Gupta A., Naughton J.F., Ramakrishnan R., Sarawagi S. On the computation of multidimensional aggregates. // Proceedings of 22nd VLDB Conf. 1996. — P.506−521.
- Aggarwal C.C., Yu P. S. Mining Large Itemsets for Association Rules. // Bulletin of the IEEE Computer Society Technical Committee on Data Engineering. 1997. — Vol.2, № 1. — P.23−31.
- Aggarwal C.C., Yu P. S. A new framework for itemset generation. // Proceedings of 17th Symposium on Principles of Database Systems. -Seattle, WA, USA. June 1998. — P. 18−24.
- Agrawal R., Imielinski Π’., Swami A. Database mining: a performance perspective. // IEEE transactions on knowledge and data engineering. -December 1993. Vol.5, № 6. — P.914−925.
- Agrawal R., Imielinski Π’., Swami A. Mining Associations between Sets of Items in Massive Databases. // Proceedings of 1993 ACM-SIGMOD International Conference on Management of Data. Washington, DC, USA.-May 1993.-P.207−216.
- Agrawal R., Srikant R. Fast Discovery of Association Rules. // Proceedings of 20th International Conference on VLDB. Santiago, Chile. — September 1994.-P.487−499.
- Agrawal R., Gupta A., Sarawagi S. Modeling multidimensional databases. // Proceedings of International Conference on Data Engineering. -Birmingham, U.K. 1997. — P.232−243.
- Bayardo R.J., Agrawal R., Gunopulos D. Constraint-based rule mining in large, dense databases. // Proceedings of 15th ICDE Conference. March 1999. — P.188−197.
- Berson A., Smith S., Thearling K. Building Data Mining Applications for CRM. McGraw Hill Professional, 1999. — 510 p.
- Beyer K., Ramakrishnan R. Bottom-up computation of sparse and iceberg CUBES. // Proceedings of SIGMOD. Philadelphia, PA, USA. — 1999. -P.359−370.
- Borgelt C., Kruse R. Induction of association rules: Apriori implementation. // Proceedings of 15th Conference on Computational Statistics (Compstat 2002). Heidelberg, Germany. — 2002.
- Borgelt C. Efficient implementations of apriori and eclat. // Proceedings of IEEE ICDM Workshop on Frequent Itemset Mining Implementations. -Melbourne, FL, USA. November 2003.
- Brin S., Motwani R., Ullman J.D., Tsur S. Dynamic itemset counting and implication rules for market basket data. // Proceedings of ACM SIGMOD International Conference on Management of Data. Tucson, Arizona, USA. — May 1997. — P.255−264.
- Codd E.F., Codd S.B., Salley C.T. Providing OLAP (On-Line Analytical Processing) to User-Analysts: An IT Mandate. E. F. Codd & Associates, 1993.-24 p.
- Data mining Π΄ΠΎΠ±ΡΡΠ° Π΄Π°Π½Π½ΡΡ . / ΠΠ°Π±ΠΎΡΠ°ΡΠΎΡΠΈΡ Basegroup. WEB: http://www.basegroup.ru/tasks/datamining.htm.
- Deshpande P.M., Agarwal S., Naughton J.F., Ramakrishnan R. Computation of Multidimensional Aggregates: Technical Report-1314 / University of Wisconsin-Madison. 1996.
- El-Hajj M., Zaiane O. Inverted Matrix: Efficient Discovery of Frequent Items in Large Datasets in the Context of Interactive Mining. // Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2003. — P.109−118.
- Fang M., Shivakumar N., Garcia-Molina H., Motwani R., Ullman J.D. Computing Iceberg Queries Efficiently. // Proceedings of International
- Conference on Very Large Databases (VLDB'98). New York. — August 1998. -P.299−310.
- Fayyad U., Piatetsky-Shapiro G., Smyth P. From Data Mining to Knowledge Discovery in Databases. // Al Magazine. 1996. — № 17(3). -P.37−54.
- Fayyad U., Piatetsky-Shapiro G., Smyth P. Knowledge Discovery and Data Mining: Towards a Unifying Framework. // Proceedings of KDD-96 Conference. 1996. — P.82−88.
- Fu L., Hammer J. CubiST: A New Algorithm for Improving the Performance of Ad-hoc OLAP Queries. // Proceedings of ACM Third International Workshop on Data Warehousing and OLAP. Washington, DC. — November 2000. — P.72−79.
- Fu L., Hammer J. CUBIST: A New Approach to Speeding Up OLAP Queries in Data Cubes: Technical Report TR01−007 / University of Florida, Gainesville, FL. May 2001. — 19 p. WEB: citeseer.ist.psu.edu/fuO 1 cubist. html, 2001.
- Goethals B. Survey on frequent pattern mining: Manuscript. 2003. — 43 p.
- Graefe G. Query evaluation techniques for large databases. // ACM Computing Surveys. June 1993. — Vol.25, № 2. — P.73−170.
- Gray J., Bosworth A., Layman A., Pirahesh H. Datacube: a relational aggregation operator, generalizing group-by, cross-tab, and sub-totals. // Proceedings of IEEE ICDE. 1996. — P. 152−159.
- Gupta H., Harinarayan V., Rajaraman A., Ullman J. Index Selection for OLAP. // Proceedings of Intl. Conf. on Data Engineering. 1997. — P.208−219.
- Gyssens M., Lakshmanan L.V.S. A foundation for multidimensional databases. // Proceedings of 23rd VLDB Conference. Athens, Greece. -1997. -P.106−115.
- Hahsler M. A comparison of commonly used interest measures for association rules. WEB: http://wwwai.wu-wien.ac.at/~hahsler/research/association rules/measures.html.
- Han J., Pei J., Dong J., Wang K. Efficient computation of iceberg cubes with complex measures. // Proceedings of SIGMOD. 2001. — P. 1−12.
- Han J., Fu Y. Discovery of multiple-level association rules from large databases. // Proceedings of 21st Int’l Conference on Very Large Databases. Zurich, Switzerland. — September 1995. — P.420−431.
- Han J., Pei J., Yin Y. Mining frequent patterns without candidate generation. // Proceedings of ACM SIGMOD International Conference on Management of Data. Dallas, USA. — 2000. — P. 1−12.
- Harinarayan V., Rajaraman A., Ullman J.D. Implementing data cubes efficiently. // Proceedings of ACM SIGMOD conference on management of data. 1996.-P.205−216.
- Hipp J., Guntzer U., Nakaeizadeh G. Algorithms for Association Rule Mining A General Survey and Comparison. // SIGKDD Explorations. -July 2000. — Vol.2, № 1. — P.58−64.
- Ho C-T., Bruck J., Agrawal R. Partial-sum queries in OLAP data cubes using covering codes. // Proceedings of 16th ACM Symposium on Principles of Database Systems. Tucson, AZ, USA. — May 1997. — P.228−237.
- Ho C.-T., Agrawal R., Megiddo N., Srikant R. Range queries in OLAP data cubes. // Proceedings of 1997 ACM SIGMOD Intl. Conf. on Management of Data. Tucson, Arizona, USA. — June 1997. — P.73−88.
- Jaroszewicz S., Simovici D.A. Pruning redundant association rules using maximum entropy principle. // Proceedings of 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining. Taipei, Taiwan. -May 2002.-P. 135−147.
- Johnson Π’., Shasha D. Hierarchically Split Cube Forests for Decision Support: description and tuned design: Technical Report TR1996−727 / Department of Computer Science, New York University. November 1996.-32 p.
- Klemettinen M., Mannila H., Ronkainen P., Toivonen H., Verkamo A.I. Finding interesting rules from large sets of discovered association rules. // Proceedings of CIKM-94. November 1994. — P.401−407.
- Knowledge discovery in databases ΠΎΠ±Π½Π°ΡΡΠΆΠ΅Π½ΠΈΠ΅ Π·Π½Π°Π½ΠΈΠΉ Π² Π±Π°Π·Π°Ρ Π΄Π°Π½Π½ΡΡ . / ΠΠ°Π±ΠΎΡΠ°ΡΠΎΡΠΈΡ Basegroup. WEB: http://www.basegroup.ru/tasks/kdd.htm.
- Lakshmanan L.V.S., Pei J., Han J. Quotient cube: How to summarize the semantics of a data cube. // Proceedings of VLDB'02. Hong Kong, China. -2002. -P.778−789.
- Lavrac N., Flach P., Zupan B. Rule evaluation measures: a unifying view. // Proceedings of 9th International Workshop on Inductive Logic Programming. 1999.-P. 174−185.
- Mannila H., Toivonen H., Verkamo A.I. Efficient algorithms for discovering association rules. // Proceedings of AAAI Workshop on Knowledge Discovery in Databases (KDD-94). Seattle, Washington.1994. P.181−192.
- Omiecinski E.R. Alternative interest measures for mining associations in databases. // IEEE Transactions on Knowledge and Data Engineering. -Jan/Feb 2003. Vol.15, № 1. -P.57−69.
- Park J.S., Chen M.-S., Yu P. S. An effective hash based algorithm for mining association rules. // Proceedings of 1995 ACM SIGMOD International Conference on Management of Data. San Jose, CA, USA.1995.-P.175−186.
- Park J.S., Chen M.-S., Yu P. S. Using a hash-based method with transaction trimming and database scan reduction for mining association rules. // IEEE Transactions on Knowledge and Data Engineering. 1997. — Vol.9, № 5. -P.813−824.
- Pendse N. Multidimensional data structures. WEB: http://www.olapreport.com/MDStructures.htm.
- Pendse N. OLAP architectures. WEB: http://www.olapreport.com/Architectures.htm.
- Pendse N. What is OLAP. WEB: http://www.olapreport.com/fasmi.htm.
- Ross K.A., Srivastava D. Fast computation of sparse datacubes. // Proceedings of 23nd VLDB Conf. Athens, Greece. — 1997. — P. 116−125.
- Ross Π., Zaman Π. Optimizing selections over data cubes: Technical report CUCS-011−98 / Department of computer science, Columbia University, USA. December 1998. — 19 p.
- Sarawagi S., Stonebraker M. Efficient Organisation of Large MultiDimensional Arrays. // Proceedings of Eleventh International Conference on Data Ingeneering. Houston, TX. — February 1994. — P.328−336.
- Sarawagi S., Agrawal R., Gupta A. On computing the data cube: Research Report RJ 10 026 / IBM Almaden Research Center, San Jose, California. -1996.- 18 p.
- Sarawagi S. Indexing OLAP data. // Data Engineering Bulletin. 1997. -Vol.20, βl.-P.36−43.
- Savasere A., Omiecinski E., Navathe S. An efficient algorithm for mining association rules in large databases. // Proceedings of 21st VLDB Conference. Zurich, Switzerland. — 1995. — P.432−443.
- Srikant R., Agrawal R. Mining Generalized Association Rules. // Proceedings of 21th International Conference on VLDB. Zurich, Switzerland. — 1995. — P.407−419.
- Tan P., Kumar V., Srivastava J. Selecting the right interestingness measure for association patterns. // Proceedings of Eight ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. -2002.-P.32−41.
- Toivonen H. Sampling Large Databases for Association Rules. // Proceedings of 22nd International Conference on Very Large Databases. -Bombay, India. September 1996. -P.134−145.
- Xin D., Han J., Li X., Wah B.W. Star-cubing: computing iceberg cubes by top-down and bottom-up integration. // Proceedings of Int. Conf. on Very Large Data Bases. 2003. — P.476−487.
- Yao Y.Y., Zhong N. An analysis of quantitative measures associated with rules. // Proceedings of Third Pacific-Asia Conference on Knowledge Discovery and Data Mining. 1999. — P.479−488.
- Zhao Y., Deshpande P.M., Naughton J.F. An array-based algorithm for simultaneous multidimensional aggregates. // Proceedings of ACM SIGMOD Conf. 1997. — P. 159−170.
- Zhao Y., Ramasamy K., Tufte K., Naughton J. Array-Based Evaluation of Multi-Dimensional Queries in Object-Relational Database Systems. // Proceedings of ICDE. Orlando, USA. — 1998. — P.241−249.