|
| |
Click on a heading to jump to the corresponding section on the page.
- Mid-tier database caching
- Query optimization
- Query processing
- Materialized views
- Hash files and hash tables
- B-tree and ISAM files
- Database integration and multidatabase systems
- Odds and ends
 | Per-Åke Larson, Jonathan Goldstein, Jingren Zhou: MTCache: Transparent
Mid-Tier Database Caching in SQL Server. ICDE 2004: 177-189 |
 | Hongfei Guo, Per-Åke Larson, Raghu Ramakrishnan, Jonathan Goldstein:
Relaxed Currency and Consistency: How to Say "Good Enough" in SQL. SIGMOD
2004: 815-826 |
 | Hongfei Guo, Per-Åke Larson, Raghu Ramakrishnan, Jonathan Goldstein:
Support for Relaxed Currency and Consistency Constraints in MTCache. SIGMOD
Conference 2004: 937-938 |
 | Per-Åke Larson, Jonathan Goldstein, Hongfei Guo, and Jingren Zhou,
MTCache: A Transparent Database Cache for SQL Server, Data Engineering
Bulletin 27(2): 35-40 (2004). |
Back to table of contents.
 | Yan W. P., Larson P.-Å., Eager Aggregation and Lazy Aggregation, VLDB
95, 1995,
345-357. (postscript,
301KB) (zip file,
88KB) |
 | Yan W. P., Larson P.-Å., Data Reduction through Early Grouping, Proc. of CASCON '94,
Toronto, Oct. 1994. (postscript,
161KB) |
 | Paulley, G. N., Larson P.-Å., Exploiting Uniqueness in Query Optimization, Proc.
1994 International Conference on Data Engineering, Houston, Texas, 1994, 68-79.
(postscript, 217KB)
(zip file, 82KB) |
 | Yan W. P., Larson P.-Å., Performing Group-By before Join, Proc. 1994 International
Conference on Data Engineering, Houston, Texas, 1994, 89-100. (postscript, 262KB)
(zip file, 82KB) |
Back to table of contents.
 | Per-Åke Larson: External Sorting: Run Formation Revisited. IEEE Trans.
on Knowledge and Data Eng. 15(4): 961-972 (2003) |
 | Per-Åke Larson: Data Reduction by Partial Preaggregation. ICDE 2002:
706-715 |
 | Larson P.-Å., Graefe G., Memory Management during Run Generation in External Sorting, SIGMOD
98, 472-483, (postscript, 1MB)
(zip file, 283KB) |
 | Weiye Zhang, Per-Åke Larson: Buffering and Read-Ahead Strategies for
External Mergesort. VLDB 1998: 523-533 |
 | Zhang W., Larson P.-Å., Dynamic Memory Adjustment for External Mergesort,
VLDB 97, 1997,
376-385. (postscript,
430KB) (zip file,
93KB) |
 | Larson P.-Å., Grouping and Duplicate Elimination: Benefits of Early Aggregation, Tech
Report, Microsoft Research, Jan 1997.(postscript,
290KB) (zip
file, 81KB) |
 | Zhang W., Larson P.-Å., A Memory-Adaptive Sort (MASORT) for Database Systems,
Proc.
of CASCON '96, Toronto, Nov. 1996.
(postscript, 243KB)
|
 | L. Zheng and P.-Å. Larson, Speeding up External Mergesort, IEEE Transactions on Data
and Knowledge Engineering, 8, 2(1996), 322-332.
(postscript, 281KB)
|
 | Martin T.P., Larson P.-Å., Deshpande V., Parallel Hash-Based Join Algorithms for a
Shared-Everything Environment, IEEE Transactions on Data and Knowledge Engineering,
6, 5(1994), 750-763.
(postscript,
302KB)
(zip file,
115KB) |
 | Seeger B., Larson P.-Å., McFadyen R., Reading a Set of Disk Pages, Proc. 19th
International Conference on Very Large Databases (VLDB93), Dublin, Ireland, 1993. |
 | Deshpande V., Larson P.-Å., The Design and Implementation of a Parallel Join Algorithm
for Nested Relations on Shared-Memory Multiprocessors, Proc. of the 8th International
Conference on Data Engineering, Tempe, Arizona, 1992, 68-77. |
 | N. Coburn, S. Verma, P.-Å. Larson, A Query Processing Architecture for Shared-Memory
Multiprocessors, University of Waterloo, Technical Report, CS-91-48, 1991. |
 | V. Deshpande, P.-Å. Larson, An Algebra for Nested Relations with Support for Nulls and
Aggregates, University of Waterloo, Technical Report, CS-91-16, 1991. |
 | Deshpande V., Larson P.-Å., Transforming from Flat Algebra to Nested Algebra,
Proc.
23rd Hawaii International Conference on System Sciences, Vol II, 1990, 298-307. |
 | Martin T. P., Deshpande V., Larson P.-Å., Parallel Join Algorithms for a Shared-Memory
Multiprocessor Environment, IEEE Symposium on Parallel and Distributed Processing,
Dallas, Texas, December 1990. |
 | Larson P.-Å., A Method for Speeding Up Text Retrieval, Proc. Databases for Business
and Office Applications, SIGMOD/Database Week, San Jose, 1983, 117-123. |
Back to table of contents.
 | Jonathan Goldstein, Per-Åke Larson:
Optimizing Queries Using Materialized Views: A practical, scalable solution. SIGMOD Conference 2001,
|
 | N. Coburn, P.-Å. Larson, Update Strategies for Derived Relations, University of
Waterloo, Technical Report, CS-90-51, 1990. (postscript, 457KB)
(zip file, 154KB)
|
 | Blakeley J. A., Coburn N., Larson P.-Å., Updating Derived Relations: Detecting
Irrelevant and Autonomously Computable Updates, ACM Transactions on Database Systems,
14, 3(1989), 369-400. (postscript, 358KB)
(zip file, 109KB) |
 | P.-Å. Larson, H. Z. Yang, Computing Queries from Derived Relations: Theoretical
Foundation, University of Waterloo, Technical Report, CS-87-35, 1987. (postscript, 766KB)
(zip file, 169KB)
|
 | Larson P.-Å., Yang H. Z., Query Transformation for PSJ-queries, Proc. 13th
International Conference on Very Large Databases (VLDB87), Brighton, England, 1987,
245-254. |
 | Blakeley J.A., Larson P.-Å., Tompa F. W., Efficiently Updating Materialized Views, Proc.
ACM-SIGMOD 1986 International Conference on Management of Data, Washington, D.C.,
1986, 61-71. (postscript,
179KB) |
 | Blakeley J. A., Coburn N., Larson P.-Å., Updating Derived Relations: Detecting
Irrelevant and Autonomously Computable Updates, Proc. 12th International Conference on
Very Large Data Bases (VLDB86), Kyoty, Japan, 1986, 457-466. |
 | Larson P.-Å., Yang H. Z., Computing Queries from Derived Relations, Proc. 11th
International Conference on Very Large Databases (VLDB85), Stockholm, Sweden, 1985,
259-269. (pdf,
1125KB) |
Back to table of contents.
 | Shu-Yuen D. Yao, Cyrus Shahabi, Per-Åke Larson, Hash-based labeling
techniques for storage scaling, VLDB Journal, available in online version. |
 | Ramakrishna M. V., Larson P.-Å., File Organizations Using Composite Perfect Hashing, ACM
Transactions on Database Systems, 14, 2(1989), 231-263. |
 | Larson P.-Å., Dynamic Hash Tables, Communications of the ACM, 31, 4(1988),
446-457. |
 | Gonnet G. H., Larson P.-Å., External Hashing with Limited Internal Storage, Journal
of the ACM, 35, 1(1988), 161-184. |
 | Larson P.-Å., Linear Hashing with Separators - A Dynamic Hashing Scheme Achieving
One-Access Retrieval, ACM Transactions on Database Systems, 13, 3(1988), 366-388. |
 | Larson P.-Å., Ramakrishna M. V., External Perfect Hashing, Proc. of ACM-SIGMOD 1985
International Conference on Management of Data, Austin, Texas, 1985, 190-199. |
 | Larson P.-Å., Linear Hashing with Overflow-Handling by Linear Probing, ACM
Transactions on Database Systems, 10, 1(1985), 75-89 |
 | Larson P.-Å., Performance Analysis of a Single-file Version of Linear Hashing, The
Computer Journal, 28, 3(1985), 319-329. |
 | Celis P., Munro J.I., Larson P.-Å., Robin Hood Hashing, Proc. 26th Symposium on
Foundations of Computer Science (FOCS85), Portland, Oregon, 1985, 281-288. |
 | Larson P.-Å., Hash Files: Some Recent Developments, Proc. 1st International
Conference on Supercomputing, St. Petersburg, Florida, 1985, 671-679. |
 | Larson P.-Å., Kajla A., File Organization: Implementation of a Method Guaranteeing
Retrieval in One Access, Communications of the ACM, 27, 7(1984), 670-677. |
 | Larson P.-Å., Analysis of Hashing with Chaining in the Prime Area, Journal of
Algorithms, 5, 1(1984), 36-47. |
 | Larson P.-Å., Analysis of Uniform Hashing, Journal of the ACM, 30, 4(1983), 805-819. |
 | Larson P.-Å., Dynamische Hashverfahren, (in German), Informatik-Spectrum, 6,
1983, 7-19. |
 | Gonnet G. H., Larson P.-Å., External Hashing with Limited Internal Storage, Proc.
ACM Symp. on Principles of Data Base Systems (PODS82), Los Angeles, 1982, 256-261. |
 | Larson P.-Å., A Single-File Version of Linear Hashing with Partial Expansions, Proc.
8th International Conference on Very Large Data Bases (VLDB82), Mexico City, 1982,
300-309. |
 | Larson P.-Å., Expected Worst-Case Performance of Hash Files, The Computer Journal,
25, 3(1982), 347-352. |
 | Larson P.-Å., Performance Analysis of Linear Hashing with Partial Expansions, ACM
Transactions on Data Base Systems, 7, 4(1982), 566-587. |
 | Larson P.-Å., Analysis of Repeated Hashing, BIT, 20, 1(1980), 25-32. |
 | Larson P.-Å., Linear Hashing with Partial Expansions, Proc. 6th International
Conference on Very Large Data Bases (VLDB80), Montreal, 1980, 224-232. |
 | P.-Å. Larson, Analysis of Finite Uniform Hashing, Åbo Akademi University, Department
of Information Processing, Technical Report A-5, 1980. |
 | Larson P.-Å., Frequency Loading and Linear Probing, BIT, 19, 2(1979), 223-228. |
 | Larson P.-Å., Dynamic Hashing, BIT, 18, 2(1978), 184-201. |
Back to table of contents.
 | Goetz Graefe, Per-Åke Larson:
B-Tree Indexes and CPU Caches. ICDE 2001: 349-358
|
 | Seeger B., Larson P.-Å., Multi-Disk B-trees, Proc. 1991 SIGMOD International
Conference on Management of Data, Denver, Colorado, 1991, 436-445. |
 | Baeza-Yates R. A., Larson P.-Å., Analysis of B+-trees with Partial
Expansions, IEEE Transactions on Data and Knowledge Engineering, 1, 2(1989),
248-257. |
 | Larson P.-Å., Deshpande V., A File Structure Supporting Traversal Recursion, Proc.
ACM-SIGMOD 1989 International Conference on Management of Data, Portland, Oregon,
1989, 243-252. |
 | Christodoulakis S., Manolopoulos Y., Larson P.-Å., Analysis of Overflow Handling for
Variable Length Records, Information Systems, 14, 2(1989), 151-161. |
 | Larson P.-Å., Analysis of Index-Sequential Files with Overflow Chaining, ACM
Transactions on Data Base Systems, 6, 4(1981), 671-680. |
 | Back to table of contents. |
 | Amiga Rahal, Qiang Zhu, Per-Åke Larson: Evolutionary techniques for
updating query cost models in a dynamic multidatabase environment. VLDB
Journal 13(2): 162-176 (2004) |
 | Amira Rahal, Qiang Zhu, Per-Åke Larson: Developing Evolutionary Cost
Models for Query Optimization in a Dynamic Multidatabase Environment. CoopIS/DOA/ODBASE
2002: 1-18 |
 | Qiang Zhu, Per-Åke Larson: Classifying Local Queries for Global Query
Optimization in Multidatabase Systems. Int. J. Cooperative Inf. Syst. 9(3):
315-355 (2000) |
 | Qiang Zhu, Per-Åke Larson: Solving Local Cost Estimation Problem for
Global Query Optimization in Multidatabase Systems. Distributed and Parallel
Databases 6(4): 373-421 (1998) |
 | Qiang Zhu, Per-Åke Larson: A Fuzzy Query Optimization Approach for
Multidatabase Systems. International Journal of Uncertainty, Fuzziness and
Knowledge-Based Systems 5(6): 701-722 (1997) |
 | Zhu Q., Larson P.-Å., Building Regression Cost Models for Multidatabase Systems, Proc.
of the 4th International Conference on Parallell and Distributed Information Systems
(PDIS96), 1996, 220-231. (postscript, 217KB) |
 | Zhu Q., Larson P.-Å., Global Query Processing and Optimization in the CORDS
Multidatabase System, Proc. of the 9th International Conference on Parallel and
Distributed Computing Systems (PDCS),1996, 640-646. (postscript, 155KB)
|
 | G.K. Attaluri, D.P. Bradshaw, N. Coburn, P.-A. Larson, A. Silberschatz, J. Slonim, Q.
Zhu, The CORDS multidatabase project, IBM Systems Journal, 34, 1(1995), 39-62.
(postscript, 317KB)
(zip file 91KB)
|
 | G.E. Blake, M.P. Consens, I.J. Davis, P. Kilpelainen, E. Kuikka, P.-Å. Larson, T.
Snider and F.W. Tompa, Text/Relational Database Management Systems: Overview and Proposed
SQL Extensions, University of Waterloo, Technical Report, CS-95-25, 1995. (postscript, 263KB)
|
 | Bradshaw D. P., Larson P.-Å., Slonim J., Transaction Scheduling in Dynamic Composite
Multidatabase Systems, Proc. of CASCON '95, Toronto, Nov. 1995, 111-131. (postscript, 250KB)
(zip file,
83KB) |
 | Attaluri G.K., Slonim J., Larson P.-Å., Concurrency Control with Lock Preemption and
Restoration, Proc. of CASCON '95, Toronto, Nov. 1995, 100-110. (postscript, 199KB)
|
 | Zhu Q., Larson P.-Å., Establishing a Fuzzy Set Cost Model for a Multidatabase System, Proc.
of the 27th Hawaii International Conference on System Sciences, 1994. |
 | Zhu Q., Larson P.-Å., A Query Sampling Method for Estimating Local Cost Parameters in a
Multidatabase System, Proc. 1994 International Conference on Data Engineering,
Houston, Texas, 1994, 144-153. |
 | M. Bauer, N. Coburn, P.-Å. Larson, and T. P. Martin, Managing Global Information in the
CORDS Multidatabase System (Experience) , Proc. of the 1994 CoopIs Conference, Toronto,
Canada, 1994, 23-34. (postscript,
259KB) |
 | G. Elizabeth Blake, Mariano P. Consens, Pekka Kilpeläinen, Per-Åke Larson, T. Snider,
Frank Wm. Tompa: Text / Relational Database Management Systems: Harmonizing SQL and SGML. Proc.
Applications of Databases (ADB94), 1994, 267-280. (postscript, 152KB)
|
 | N. Coburn, P.-Å. Larson, T.P. Martin, J. Slonim, CORDS Multidatabase Project: Research
and Prototype Overview, Proc. of CASCON '93, Toronto, 1993, 767-778. |
 | Zhu Q., Larson P.-Å., Query Optimization Using Fuzzy Set Theory for Multidatabase
Systems, Proc. of CASCON '93, Toronto, 1993, 848-859. |
 | G.K. Attaluri, J. Slonim, P.-Å. Larson, Advanced Transaction Systems in the CORDS
Multidatabase System Environment, Proc. of Workshop on Next Generation Information
Technologies and Systems (NGITS93), Haifa, Israel, 1993. |
 | P.-Å. Larson, N.Coburn, Multidatabase Services: Issues and Architectural Design, Proc.
of CASCON '92, Vol II, Toronto, 1992, 57-66. |
 | P. Martin, M. Bauer, N. Coburn, P.-Å. Larson, G. Neufeld, J. Pachl and J. Slonim,
Directory Requirements for a Multidatabase Service, Proc. of CASCON '92, Vol II,
Toronto, 1992, 339-350. |
Back to table of contents.
 | Meikel Pöss, Bryan Smith, Lubor Kollár, Per-Åke Larson: TPC-DS, taking
decision support benchmarking to the next level. SIGMOD Conference 2002:
582-587. (pdf)
|
 | Per-Åke Larson, Murali Krishnan:
Memory Allocation for Long-Running Server Applications.
ISMM 1998: 176-185
|
 | M.A. Bauer, N. Coburn, D.L. Erickson, P.J. Finnigan, J.W. Hong, P-A Larson, J, Pachl, J.
Slonim, D.J. Taylor, and T.J. Teorey, A distributed system architecture for a distributed
application environment, IBM Systems Journal, 33, 3(1994), 399-425. |
 | J. Slonim, M.A. Bauer, P-A Larson, J. Schwarz, C. Butler, E.B. Buss, and D. Sabbah, The
Centre for Advanced Studies: A model for applied research and development, IBM Systems
Journal, 33, 3(1994), 382-398. |
 | M.A. Bauer, N. Coburn, D.L. Erickson, P.J. Finnigan, J.W. Hong, P.-Å. Larson, J.
Slonim, An Integrated Architecture for Distributed Applications, Proc. of CASCON '93,
Toronto, 1993, 8-26. |
 | M.A. Bauer, R.E. Strom, N.Coburn, D.L. Erickson, P.J. Finnigan, J.W. Hong, P.-Å.
Larson, J. Slonim, Issues in Distributed Architectures: A Comparison of Two Paradigms, Proc.
of International IFIP Workshop on Open Distributed Processing, Berlin, Germany, 1993. |
 | J. Slonim, M. Bauer, P.-Å. Larson, E. Buss and D. Sabbah, CAS: A Centre for Applied
Research and Development, Proc. of CASCON '92, Vol I, Toronto, 1992, 91-112. |
 | Q. Zhu, P.-Å. Larson, F. Pellow, Supporting Database Access in the Hermes Programming
Language, Proc. of CASCON '91, Toronto, 1991, 205-222. |
 | D. Bradshaw, P.-Å. Larson, R. Sunday, Transaction Management in Hermes, Proc. of
CASCON '91, Toronto, 1991, 223-238. |
 | J. Slonim, M. Bauer, P. Finnigan, P.-Å. Larson, T. Teorey, A. Mendelzon, R. McBride, Y.
Yemini, and S. Yemini, Distributed Programming Environment: Challenges, Proc. of
International IFIP Workshop on Open Distributed Processing, Berlin, 1991, 379-394. |
 | Larson P.-Å., The Data Model and Query Language of LauRel, Data Engineering Bulletin,
11, 3(1988), 23-30. |
Back to table of contents.
|