Ȩ > Ç¥ÁØÈ °³¿ä > TTAÀÇ Ç¥ÁØÇöȲ
Ç¥ÁعøÈ£ | TTAE.OT-10.0407 | ±¸Ç¥ÁعøÈ£ | |
---|---|---|---|
Á¦°³Á¤ÀÏ | 2016-12-27 | ÃÑÆäÀÌÁö | 88 |
ÇѱÛÇ¥Áظí | À妽ºµå µ¥ÀÌŸº£À̽º API | ||
¿µ¹®Ç¥Áظí | Indexed Database API | ||
Çѱ۳»¿ë¿ä¾à | À妽ºµå µ¥ÀÌÅͺ£À̽º API´Â À¥ Ŭ¶óÀ̾ðÆ®¿¡¼ ¸¹Àº ¾çÀÇ ±¸Á¶ÈµÈ µ¥ÀÌÅ͸¦ À妽º¸¦ ÀÌ¿ëÇؼ ³ôÀº ¼º´ÉÀ¸·Î °Ë»öÇÒ ¼ö ÀÖ°Ô ÇØÁÖ´Â APIÀÌ´Ù. °¢ ·¹ÄÚµå´Â Å°¿Í °ªÀ¸·Î ±¸¼ºµÇ¸ç, µ¥ÀÌÅͺ£À̽º´Â ÀúÀå ±â·ÏÀ» ÅëÇØ À妽º¸¦ À¯ÁöÇÑ´Ù. ¾ÖÇø®ÄÉÀÌ¼Ç °³¹ßÀÚ°¡ Á÷Á¢ Å° ¶Ç´Â À妽º¸¦ ÀÌ¿ëÇÏ¿© ¾î´À ÇϳªÀÇ À§Ä¡ ±â·ÏÇÏ´Â API¸¦ »ç¿ëÇÑ´Ù. »öÀÎ µ¥ÀÌÅͺ£À̽º´Â Áö¼Ó B Æ®¸® µ¥ÀÌÅÍ ±¸Á¶¸¦ »ç¿ëÇÏ¿© ±¸Çö µÉ ¼ö ÀÖ´Ù. | ||
¿µ¹®³»¿ë¿ä¾à | User agents need to store large numbers of objects locally in order to satisfy off-line data requirements of Web applications. [WEBSTORAGE] is useful for storing pairs of keys and their corresponding values. However, it does not provide in-order retrieval of keys, efficient searching over values, or storage of duplicate values for a key.
The stanfard presents a concrete API to perform advanced key-value data management that is at the heart of most sophisticated query processors. It does so by using transactional databases to store keys and their corresponding values (one or more per key), and providing a means of traversing keys in a deterministic order. It is often implemented through the use of persistent B-tree data structures that are considered efficient for insertion and deletion as well as in-order traversal of very large numbers of data records. |
||
±¹Á¦Ç¥ÁØ | |||
°ü·ÃÆÄÀÏ |
![]() |
- ÀÌÀü
- ´Ù±¹¾î ÀüÀÚ¿ìÆí ÁÖ¼Ò Ã¼°è
- ´ÙÀ½
- IPTV ´Ü¸» °³¿ä