30 papers:
PPoPP-2013-WuZZJS #algorithm #analysis #complexity #design #gpu #memory management- Complexity analysis and algorithm design for reorganizing data to minimize non-coalesced memory accesses on GPU (BW, ZZ, EZZ, YJ, XS), pp. 57–68.
SIGMOD-2011-BeierSS #online- Online reorganization in read optimized MMDBS (FB, KS, KUS), pp. 1125–1136.
SIGIR-2008-BrisaboaFLN- Reorganizing compressed text (NRB, AF, SL, GN), pp. 139–146.
ICPR-v4-2004-MarkouS #feature model- Feature Selection based on a Black Hole Model of Data Reorganization (MM, SS), pp. 565–568.
SPLC-2004-JolleyKB #product line- Governing Software Product Lines and Reorganizations (TMJ, DJK, TRB), pp. 1–17.
CIKM-2001-FuCJ #data access #web- Reorganizing Web Sites Based on User Access Patterns (YF, MC, CJ), pp. 583–585.
- SIGMOD-2000-LakhamrajuRSS #database #online
- On-line Reorganization in Object Databases (MKL, RR, SS, SS), pp. 58–69.
PLDI-1999-DingK #performance #runtime- Improving Cache Performance in Dynamic Applications through Data and Computation Reorganization at Run Time (CD, KK), pp. 229–241.
VLDB-1998-ZouS #online- Safely and Efficiently Updating References During On-line Reorganization (CZ, BS), pp. 512–522.
- SIGMOD-1996-ZouS #online
- On-line Reorganization of Sparsely-populated B+trees (CZ, BS), pp. 115–124.
CAiSE-1996-BellahsenePT #design #information management- Views for Information System Design without Reorganization (ZB, PP, MT), pp. 496–513.
OOPSLA-1996-R- Reorganizing Split Objects (HA), pp. 138–149.
SAC-1995-ChenH #algorithm #analysis #concurrent #database #performance- Performance analysis of a periodic data reorganization algorithm for concurrent B-trees in database systems (IRC, SH), pp. 40–45.
ICSM-1994-AmmannC #in the large- Inter-Module Renaming and Reorganizing: Examples of Program Manipulation-in-the-Large (MMA, RDC), pp. 354–361.
- VLDB-1992-SalzbergD #online #transaction
- Principles of Transaction-Based On-Line Reorganization (BS, AD), pp. 511–520.
ECOOP-1992-Casais #approach #incremental- An Incremental Class Reorganization Approach (EC), pp. 114–132.
- PLDI-1991-WilsonLM #effectiveness #garbage collection #locality
- Effective “Static-Graph” Reorganization to Improve Locality in Garbage-Collected Systems (PRW, MSL, TGM), pp. 177–191.
- OOPSLA-ECOOP-1990-LernerH #database #evolution
- Beyond Schema Evolution to Database Reorganization (BSL, ANH), pp. 67–76.
- VLDB-1987-MarkowitzM #database #incremental #relational
- Incremental Reorganization of Relational Databases (VMM, JAM), pp. 127–135.
- VLDB-1985-Omiecinski #incremental
- Incremental File Reorganization Schemes (EO), pp. 346–357.
- SIGIR-1984-OmiecinskiS #approach #clustering
- A Global Approach to Record Clustering and File Reorganization (EO, PS), pp. 201–219.
POPL-1982-HennessyG #code generation #constraints #pipes and filters- Code Generation and Reorganization in the Presence of Pipeline Constraints (JLH, TRG), pp. 120–127.
DAC-1981-TanakaMNOTK #array #design #logic- An integrated computer aided design system for gate array masterslices: Part 1. Logic reorganization system LORES-2 (CT, SM, SN, TO, MT, KK), pp. 59–65.
- VLDB-1981-Soderlund #assessment #concurrent #database #modelling
- Concurrent Data Base Reorganization — Assessment of a Powerful Technique through Modeling (LS), pp. 499–509.
- SIGMOD-1980-GudesT
- Experiments with B-Tree Reorganization (EG, ST), pp. 200–206.
- DAC-1978-NakamuraMTTFK #logic #named
- LORES — Logic Reorganization System (SN, SM, CT, MT, HF, KK), pp. 250–260.
- SIGMOD-1977-LohmanM #policy
- Optimal Policy for Batch Operations: Backup, Checkpointing, Reorganization, and Updating (Abstract) (GML, JAM), p. 157.
- VLDB-J-1975-YaoDT76 #algorithm #database
- A Dynamic Database Reorganization Algorithm (SBY, KSD, TJT), pp. 159–174.
- VLDB-1975-DasTY #design
- Reorganization Points for File Designs with Nonlinear Processing Costs (KSD, TJT, SBY), pp. 516–518.
- SIGFIDET-1974-FryJ #towards
- Towards a Formulation and Definition of Data Reorganization (JPF, DWJ), pp. 83–100.
