![]() ![]() ![]() It can improve the response speed of subsequent queries by building a complete index in advance. Indexes provide a method to access data in databases quickly. This behavior is visible even when the user focus is randomly shifting to di! erent parts of the data. We show that the resulting system is able to self-organize based on incom- ing requests with clear performance benefits. The experiences and results obtained are indicative of a significant reduction in system complexity. Furthermore, we illustrate the ripple e! ect of dynamic reorganization on the query plans derived by the SQL opti- mizer. It led to a minor enhancement to its relational algebra kernel, such that cracking could be piggy-backed without incurring too much processing over- head. We present the first mature cracking architecture and re- port on our implementation of cracking in the context of a full fledged relational system. The motivation is that by automatically organizing data the way users request it, we can achieve fast access and the much desired self-organized behavior. In this pa- per, we study the complementary approach, addressing in- dex maintenance as part of query processing using continu- ous physical reorganization, i.e., cracking the database into manageable pieces. Their mainte- nance cost is taken during database updates. Database indices provide a non-discriminative navigational infrastructure to localize tuples of interest. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |