Thread-level parallel indexing of update intensive moving-object workloads

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6849 LNCS, Issue , 2011, Pages 186-204

  Šidlauskas, Darius ^a   Ross, Kenneth A ^b   Jensen, Christian S ^c   Šaltenis, Simonas ^a  

^a AALBORG UNIVERSITY   (Denmark)

^b Och Spine at New York Presbyterian Hospitals   (United States)

^c AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EMPIRICAL STUDIES; GRID-BASED INDEXING; HARDWARE THREADS; MAIN-MEMORY; MODERN PROCESSORS; NON-TRIVIAL; PARALLEL PROCESSING; STATE-OF-THE-ART APPROACH; SYSTEM CALLS;

CLONING; INDEXING (MATERIALS WORKING); INDEXING (OF INFORMATION);

PARALLEL PROCESSING SYSTEMS;

EID: 80052776694     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22922-0_12     Document Type: Conference Paper

References (19)

1. Akman, V., Franklin, W.R., Kankanhalli, M., Narayanaswami, C.: Geometric computing and the uniform grid data technique. Computer Aided Design 21(7), 410-420 (1989)
2. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, pp. 322-331 (1990)
3. Biveinis, L., Šaltenis, S., Jensen, C.S.: Main-memory operation buffering for efficient R-tree update. In: VLDB, pp. 591-602 (2007)
4. Chen, S., Jensen, C.S., Lin, D.: A benchmark for evaluating moving object indexes. PVLDB 1(2), 1574-1585 (2008)
5. Cieslewicz, J., Ross, K.A., Satsumi, K., Ye, Y.: Automatic contention detection and amelioration for data-intensive operations. In: SIGMOD, pp. 483-494 (2010)
6. Dittrich, J., Blunschi, L., Salles, M.A.V.: Indexing moving objects using short-lived throwaway indexes. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) SSTD 2009. LNCS, vol. 5644, pp. 189-207. Springer, Heidelberg (2009)
7. Finkel, R.A., Bentley, J.L.: Quad trees: a data structure for retrieval on composite keys. Acta Informatica 4(1), 1-9 (1974)
8. Hwang, S., Kwon, K., Cha, S., Lee, B.: Performance evaluation of main-memory R-tree variants. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol. 2750, Springer, Heidelberg (2003)
9. Jensen, C., Tiesyte, D., Tradisauskas, N.: The COST Benchmark-Comparison and evaluation of spatio-temporal indexes. Database Systems for Advanced Applications, 125-140 (2006)
10. Kim, K., Cha, S.K., Kwon, K.: Optimizing multidimensional index trees for main memory access. In: SIGMOD, pp. 139-150 (2001)
11. Lee, M.L., Hsu, W., Jensen, C.S., Cui, B., Teo, K.L.: Supporting frequent updates in R-trees: a bottom-up approach. In: VLDB, pp. 608-619 (2003)
12. Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The grid file: An adaptable, symmetric multikey file structure. ACM TODS 9(1), 38-71 (1984)
13. Rastogi, R., Seshadri, S., Bohannon, P., Leinbaugh, D.W., Silberschatz, A., Sudarshan, S.: Logical and physical versioning in main memory databases. In: VLDB, pp. 86-95 (1997)
14. Severance, D.G., Lohman, G.M.: Differential files: their application to the maintenance of large databases. ACM TODS 1(3), 256-267 (1976)
15. Smith, J.M., Maguire, G.Q.: Effects of copy-on-write memory management on the response time of UNIX fork operations, vol. 1, pp. 255-278. University of California Press, Berkeley (1988)
16. Song, M., Kitagawa, H.: Managing frequent updates in R-trees for update-intensive applications. IEEE TKDE 21(11), 1573-1589 (2009)
17. Tropf, H., Herzog, H.: Multidimensional range search in dynamically balanced trees. Angewandte Informatik 23(2), 71-77 (1981)
18. Tzoumas, K., Yiu, M.L., Jensen, C.S.: Workload-aware indexing of continuously moving objects. PVLDB 1(2), 1186-1197 (2009)
19. Šidlauskas, D., Šaltenis, S., Christiansen, C.W., Johansen, J.M., Šaulys, D.: Trees or grids? Indexing moving objects in main memory. In: GIS, pp. 236-245 (2009)