Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

Per-Åke Larson

Papers on DiSC'04


MTCache: Mid-Tier Database Caching for SQL Server

Relaxed Currency and Consistency: How to Say "Good Enough" in SQL

Support for Relaxed Currency and Consistency Constraints in MTCache

Evolutionary techniques for updating query cost models in a dynamic multidatabase environment

Publications


Note: Links lead to the DBLP on the Web.

Per-Åke Larson

David DeHaan , Per-Åke Larson, Jingren Zhou : Stacked Materialized Views. SIGMOD Conference 2005

Shu-Yuen Didi Yao , Cyrus Shahabi , Per-Åke Larson: Hash-based labeling techniques for storage scaling. VLDB J. 14 (2): 222-237 (2005)

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 Conference 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

Amira Rahal , Qiang Zhu , Per-Åke Larson: Evolutionary techniques for updating query cost models in a dynamic multidatabase environment. VLDB J. 13 (2): 162-176 (2004)

Per-Åke Larson, Jonathan Goldstein , Jingren Zhou : Transparent Mid-Tier Database Caching in SQL Server. SIGMOD Conference 2003 : 661

Per-Åke Larson, Masaru Kitsuregawa , Betty Salzberg : Nominations for Chair of TCDE. IEEE Data Eng. Bull. 26 (3): 1 (2003)

Per-Åke Larson: TC on Data Engineering: Election of Chair for 2004-2005. IEEE Data Eng. Bull. 26 (4): 1 (2003)

Per-Åke Larson: External Sorting: Run Formation Revisited. IEEE Trans. Knowl. Data Eng. 15 (4): 961-972 (2003)

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

Per-Åke Larson: Data Reduction by Partial Preaggregation. ICDE 2002 : 706-715

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

Goetz Graefe , Per-Åke Larson: B-Tree Indexes and CPU Caches. ICDE 2001 : 349-358

Jonathan Goldstein , Per-Åke Larson: Optimizing Queries Using Materialized Views: A practical, scalable solution. SIGMOD Conference 2001

Per-Åke Larson: XML Data Management Go Native or Spruce up Relational Systems? (Panel Abstract). SIGMOD Conference 2001

Per-Åke Larson, Masaru Kitsuregawa , Betty Salzberg : Nominations for Chair of TCDE. IEEE Data Eng. Bull. 24 (2): 1 (2001)

Per-Åke Larson, Masaru Kitsuregawa , Betty Salzberg : New TCDE Chair for 2002-2003. IEEE Data Eng. Bull. 24 (4): 2 (2001)

Kenneth A. Ross , Stefano Ceri , Luis Gravano , Per-Åke Larson, Leonid Libkin , Tova Milo : Reminiscences on Influential Papers. SIGMOD Record 30 (1): 55-57 (2001)

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)

Weiye Zhang , Per-Åke Larson: Speeding up Heterogeneous Data Access by Converting and Pushing Down String Comparisons. ICDE 1999 : 261

Per-Åke Larson: TC on Data Engineering: Election of Chair for 2000-01. IEEE Data Eng. Bull. 22 (4): 2-3 (1999)

Per-Åke Larson, Murali Krishnan : Memory Allocation for Long-Running Server Applications. ISMM 1998 : 176-185

Per-Åke Larson, Goetz Graefe : Memory Management During Run Generation in External Sorting. SIGMOD Conference 1998 : 472-483

Weiye Zhang , Per-Åke Larson: Buffering and Read-Ahead Strategies for External Mergesort. VLDB 1998 : 523-533

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)

David B. Lomet , Roger S. Barga , Surajit Chaudhuri , Per-Åke Larson, Vivek R. Narasayya : The Microsoft Database Research Group. SIGMOD Record 27 (3): 81-85 (1998)

W. A. Gray , Per-Åke Larson: Proceedings of the Thirteenth International Conference on Data Engineering, April 7-11, 1997 Birmingham U.K. IEEE Computer Society 1997

Weiye Zhang , Per-Åke Larson: Dynamic Memory Adjustment for External Mergesort. VLDB 1997 : 376-385

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)

Qiang Zhu , Per-Åke Larson: Developing Regression Cost Models for Multidatabase Systems. PDIS 1996 : 220-231

LuoQuan Zheng , Per-Åke Larson: Speeding up External Mergesort. IEEE Trans. Knowl. Data Eng. 8 (2): 322-332 (1996)

Weipeng P. Yan , Per-Åke Larson: Eager Aggregation and Lazy Aggregation. VLDB 1995 : 345-357

Gopi K. Attaluri , Dexter P. Bradshaw , Neil Coburn , Per-Åke Larson, Patrick Martin , Abraham Silberschatz , Jacob Slonim , Qiang Zhu : The CORDS Multidatabase Project. IBM Systems Journal 34 (1): 39-62 (1995)

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. ADB 1994 : 267-280

Michael Bauer , Neil Coburn , Per-Åke Larson, Patrick Martin : Managing Global Information in the CORDS Multidatabase System. CoopIS 1994 : 23-34

Qiang Zhu , Per-Åke Larson: Establishing a Fuzzy Cost Model for Query Optimization in a Multidatabase System. HICSS (2) 1994 : 263-272

Qiang Zhu , Per-Åke Larson: A Query Sampling Method of Estimating Local Cost Parameters in a Multidatabase System. ICDE 1994 : 144-153

G. N. Paulley , Per-Åke Larson: Exploiting Uniqueness in Query Optimization. ICDE 1994 : 68-79

Weipeng P. Yan , Per-Åke Larson: Performing Group-By before Join. ICDE 1994 : 89-100

Jacob Slonim , Michael A. Bauer , Per-Åke Larson, John Schwarz , Cindy Butler , Erich B. Buss , Daniel Sabbah : The Centre for Advanced Studies: A Model for Applied Research and Development. IBM Systems Journal 33 (3): 382-398 (1994)

Michael A. Bauer , Neil Coburn , Doreen L. Erickson , Patrick J. Finnigan , James W. Hong , Per-Åke Larson, Jan K. Pachl , Jacob Slonim , David J. Taylor , Toby J. Teorey : A Distributed System Architecture for a Distributed Application Environment. IBM Systems Journal 33 (3): 399-425 (1994)

T. Patrick Martin , Per-Åke Larson, Vinay Deshpande : Parallel Hash-Based Join Algorithms for a Shared-Everything. IEEE Trans. Knowl. Data Eng. 6 (5): 750-763 (1994)

Jacob Slonim , Per-Åke Larson, Gopi K. Attaluri : Advanced Transaction Systems in CORDS Multidatabase System Environment. NGITS 1993 : 0-

Bernhard Seeger , Per-Åke Larson, Ron McFadyen : Reading a Set of Disk Pages. VLDB 1993 : 592-603

V. Deshpande , Per-Åke Larson: The Design and Implementation of a Parallel Join Algorithm for Nested Relations on Shared-Memory Multiprocessors. ICDE 1992 : 68-77

Jacob Slonim , Michael Bauer , Per-Åke Larson, Patrick J. Finnigan , Toby J. Teorey , Alberto O. Mendelzon , Richard McBride , Yechiam Yemini , Shaula Yemini : Distributed Programming Environment: Challenges. Open Distributed Processing 1991 : 379-394

Bernhard Seeger , Per-Åke Larson: Multi-Disk B-trees. SIGMOD Conference 1991 : 436-445

Per-Åke Larson, V. Deshpande : A File Structure Supporting Traversal Recursion. SIGMOD Conference 1989 : 243-252

M. V. Ramakrishna , Per-Åke Larson: File Organization Using Composite Perfect Hashing. ACM Trans. Database Syst. 14 (2): 231-263 (1989)

José A. Blakeley , Neil Coburn , Per-Åke Larson: Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates. ACM Trans. Database Syst. 14 (3): 369-400 (1989)

Ricardo A. Baeza-Yates , Per-Åke Larson: Performance of B+-Trees with Partial Expansions. IEEE Trans. Knowl. Data Eng. 1 (2): 248-257 (1989)

Stavros Christodoulakis , Yannis Manolopoulos , Per-Åke Larson: Analysis of Overflow Handling for Variable Length Records. Inf. Syst. 14 (2): 151-162 (1989)

Haran Boral , Per-Åke Larson: Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, June 1-3, 1988. ACM Press 1988

Per-Åke Larson: Linear Hashing with Separators - A Dynamic Hashing Scheme Achieving One-Access Retrieval. ACM Trans. Database Syst. 13 (3): 366-388 (1988)

Per-Åke Larson: Dynamic Hash Tables. Commun. ACM 31 (4): 446-457 (1988)

Per-Åke Larson: The Data Model and Query Language of LauRel. IEEE Data Eng. Bull. 11 (3): 23-30 (1988)

Gaston H. Gonnet , Per-Åke Larson: External hashing with limited internal storage. J. ACM 35 (1): 161-184 (1988)

H. Z. Yang , Per-Åke Larson: Query Transformation for PSJ-Queries. VLDB 1987 : 245-254

José A. Blakeley , Per-Åke Larson, Frank Wm. Tompa : Efficiently Updating Materialized Views. SIGMOD Conference 1986 : 61-71

José A. Blakeley , Neil Coburn , Per-Åke Larson: Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates. VLDB 1986 : 457-466

Pedro Celis , Per-Åke Larson, J. Ian Munro : Robin Hood Hashing (Preliminary Report) FOCS 1985 : 281-288

Per-Åke Larson, M. V. Ramakrishna : External Perfect Hashing. SIGMOD Conference 1985 : 190-200

Per-Åke Larson, H. Z. Yang : Computing Queries from Derived Relations. VLDB 1985 : 259-269

Per-Åke Larson: Linear Hashing with Overflow-Handling by Linear Probing. ACM Trans. Database Syst. 10 (1): 75-89 (1985)

Per-Åke Larson: Performance Analysis of a Single-File Version of Linear Hashing. Comput. J. 28 (3): 319-329 (1985)

Per-Åke Larson, Ajay Kajla : File Organization: Implementation of a Method Guaranteeing Retrieval in One Access. Commun. ACM 27 (7): 670-677 (1984)

Per-Åke Larson: A Method for Speeding up Text Retrieval. DATA BASE 15 (2): 19-23 (1984)

Per-Åke Larson: Analysis of Hashing with Chaining in the Prime Area. J. Algorithms 5 (1): 36-47 (1984)

Per-Åke Larson: A Method for Speeding Up Text Retrieval. Databases for Business and Office Applications 1983 : 117-123

Per-Åke Larson: Dynamische Hashverfahren. Informatik Spektrum 6 (1): 7-19 (1983)

Per-Åke Larson: Analysis of Uniform Hashing J. ACM 30 (4): 805-819 (1983)

Gaston H. Gonnet , Per-Åke Larson: External Hashing with Limited Internal Storage. PODS 1982 : 256-261

Per-Åke Larson: A Single-File Version of Linear Hashing with Partial Expansions. VLDB 1982 : 300-309

Per-Åke Larson: Performance Analysis of Linear Hashing with Partial Expansions. ACM Trans. Database Syst. 7 (4): 566-587 (1982)

Per-Åke Larson: Expected Worst-Case Performance of Hash Files. Comput. J. 25 (3): 347-352 (1982)

Gaston H. Gonnet , Per-Åke Larson, J. Ian Munro , Doron Rotem , David J. Taylor , Frank Wm. Tompa : Database Storage Structures Research at the University of Waterloo. IEEE Database Eng. Bull. 5 (1): 49-52 (1982)

Per-Åke Larson: Analysis of Index-Sequential Files with Overflow Chaining. ACM Trans. Database Syst. 6 (4): 671-680 (1981)

Per-Åke Larson: Linear Hashing with Partial Expansions. VLDB 1980 : 224-232

Per-Åke Larson: Analysis of Repeated Hashing. BIT 20 (1): 25-32 (1980)

Per-Åke Larson: Dynamic Hashing. BIT 18 (2): 184-201 (1978)

1 [ 38 ] [ 48 ]

2 [ 30 ]

3 [ 55 ]

4 [ 35 ] [ 46 ]

5 [ 40 ] [ 41 ]

6 [ 47 ]

7 [ 21 ] [ 22 ] [ 31 ]

8 [ 28 ]

9 [ 48 ]

10 [ 41 ]

11 [ 41 ]

12 [ 20 ]

13 [ 63 ]

14 [ 55 ]

15 [ 29 ]

16 [ 21 ] [ 31 ] [ 40 ] [ 46 ] [ 48 ]

17 [ 47 ]

18 [ 81 ]

19 [ 33 ] [ 36 ]

20 [ 39 ]

21 [ 40 ]

22 [ 35 ] [ 40 ]

23 [ 67 ] [ 75 ] [ 77 ] [ 78 ] [ 79 ]

24 [ 5 ] [ 9 ] [ 24 ]

25 [ 58 ] [ 68 ]

26 [ 63 ]

27 [ 54 ]

28 [ 77 ] [ 78 ]

29 [ 40 ]

30 [ 15 ]

31 [ 47 ]

32 [ 64 ] [ 65 ] [ 74 ]

33 [ 69 ]

34 [ 59 ]

35 [ 63 ]

36 [ 55 ]

37 [ 29 ]

38 [ 46 ] [ 48 ]

39 [ 39 ]

40 [ 35 ]

41 [ 37 ]

42 [ 35 ]

43 [ 63 ]

44 [ 5 ] [ 20 ]

45 [ 55 ]

46 [ 40 ]

47 [ 43 ]

48 [ 69 ]

49 [ 71 ] [ 76 ]

50 [ 19 ] [ 32 ]

51 [ 77 ] [ 78 ]

52 [ 63 ]

53 [ 5 ]

54 [ 41 ]

55 [ 64 ] [ 65 ] [ 74 ]

56 [ 41 ]

57 [ 34 ] [ 37 ]

58 [ 80 ]

59 [ 48 ]

60 [ 35 ] [ 38 ] [ 40 ] [ 41 ] [ 48 ]

61 [ 69 ]

62 [ 47 ]

63 [ 5 ] [ 40 ]

64 [ 35 ] [ 40 ]

65 [ 5 ] [ 22 ] [ 47 ]

66 [ 42 ] [ 49 ]

67 [ 18 ] [ 23 ]

68 [ 80 ]

69 [ 35 ]

70 [ 35 ]

71 [ 53 ] [ 57 ] [ 61 ]

72 [ 50 ]

73 [ 75 ] [ 79 ] [ 81 ]

74 [ 44 ] [ 45 ] [ 48 ] [ 51 ] [ 52 ] [ 56 ] [ 62 ] [ 71 ] [ 76 ]




©2005 Association for Computing Machinery