Welcome to D
SIGMOD 2003
PODS 2003
SIGMOD-RECOR
ADBIS
CIDR 2003
CIKM 2003
DASFAA 2003
Data Enginee
DEBS
DMKD 2003
DOLAP 2003
DPDJ 2003
ER
GIS 2003
Hypertext 20
ICDE 2003
ICDM 2003
ICDT 2003
JCDL 2003
KRDB 2003
MIR 2003
MIS 2003
MMDB 2003
RIDE 2003
SBBD 2003
SIGIR 2003
SIGIR-FORUM
SIGKDD 2003
SIGKDD-EXP
SSDBM 2003
TIME 2003
TODS
VLDB 2003
VLDB Journal
WIDM 2003
About DiSC 2
Editorial Bo
Acknowledgem
DiSC 2004 Pr
ADVIS
DiSC'04 Feed
DiSC'04 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Betty Salzberg

Papers on DiSC'04


The CenSSIS Image Database

Publications


Note: Links lead to the DBLP on the Web.

Betty Salzberg

Betty Salzberg, Linan Jiang , David B. Lomet , Manuel Barrena García , Jing Shan , Evangelos Kanoulas : A Framework for Access Methods for Versioned Data. EDBT 2004 : 730-747

Huanmei Wu , Betty Salzberg, Donghui Zhang : Online Event-driven Subsequence Matching over Financial Data Streams. SIGMOD Conference 2004

Huanmei Wu , Becky Norum , Judith Newmark , Betty Salzberg, Carol M. Warner , Charles DiMarzio , David R. Kaeli : The CenSSIS Image Database. SSDBM 2003 : 117-126

Jing Shan , Donghui Zhang , Betty Salzberg: On Spatial-Range Closest-Pair Query. SSTD 2003 : 252-269

Linan Jiang , Betty Salzberg, David B. Lomet , Manuel Barrena García : The BTR-Tree: Path-Defined Version-Range Splitting in a Branched and Temporal Structure. SSTD 2003 : 28-45

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

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)

Linan Jiang , Betty Salzberg, David B. Lomet , Manuel Barrena García : The BT-tree: A Branched and Temporal Access Method. VLDB 2000 : 451-460

Betty Salzberg: Letter from the TCDE Chair. IEEE Data Eng. Bull. 23 (1): 2 (2000)

Betty Salzberg, Vassilis J. Tsotras : Comparison of Access Methods for Time-Evolving Data. ACM Comput. Surv. 31 (2): 158-221 (1999)

Betty Salzberg: Review - A Method for On-Line Reorganization of a Database. ACM SIGMOD Digital Review 1 : (1999)

Betty Salzberg: Review - Don't Scrap It, Wrap It! A Wrapper Architecture for Legacy Data Sources. ACM SIGMOD Digital Review 1 : (1999)

Chendong Zou , Betty Salzberg, Rivka Ladin : Back to the Future: Dynamic Hierarchical Clustering. ICDE 1998 : 578-587

Chendong Zou , Betty Salzberg: Safely and Efficiently Updating References During On-line Reorganization. VLDB 1998 : 512-522

Betty Salzberg: Letter from the new TC Chair. IEEE Data Eng. Bull. 21 (1): 1 (1998)

Betty Salzberg: Letter from the Chair of the TC on Data Engineering. IEEE Data Eng. Bull. 21 (2): 1 (1998)

Betty Salzberg: Letter from the TC Chair. IEEE Data Eng. Bull. 21 (3): 1 (1998)

Betty Salzberg: Access Methods. The Computer Science and Engineering Handbook 1997 : 1012-1037

Betty Salzberg: Letter from the Special Issue Editor. IEEE Data Eng. Bull. 20 (2): 2 (1997)

Georgios Evangelidis , David B. Lomet , Betty Salzberg: The hB-Pi-Tree: A Multi-Attribute Index Supporting Concurrency, Recovery and Node Consolidation. VLDB J. 6 (1): 1-25 (1997)

David B. Lomet , Betty Salzberg: Concurrency and Recovery for Index Trees. VLDB J. 6 (3): 224-240 (1997)

Betty Salzberg, Dimitri Tombroff : DSDT: Durable Scripts Containing Database Transactions. ICDE 1996 : 624-633

Chendong Zou , Betty Salzberg: On-line Reorganization of Sparsely-populated B+trees. SIGMOD Conference 1996 : 115-124

Betty Salzberg: Access Methods. ACM Comput. Surv. 28 (1): 117-120 (1996)

Betty Salzberg: Letter from the Special Issue Editor. IEEE Data Eng. Bull. 19 (2): 2-3 (1996)

Chendong Zou , Betty Salzberg: Towards Efficient Online Database Reorganization. IEEE Data Eng. Bull. 19 (2): 33-40 (1996)

Georgios Evangelidis , David B. Lomet , Betty Salzberg: The hBP-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation. VLDB 1995 : 551-561

Andreas Reuter , Stefano Ceri , Jim Gray , Betty Salzberg, Gerhard Weikum : Databases and Workflow Management: What is it All About? (Panel). VLDB 1995 : 632

Betty Salzberg: Timestamping After Commit. PDIS 1994 : 160-167

Betty Salzberg: On Indexing Spatial and Temporal Data, Invited Project Review. Inf. Syst. 19 (6): 447-465 (1994)

Betty Salzberg: The Case for Commit-Time Timestamping in Historical Databases. HPTS 1993 : 0-

David B. Lomet , Betty Salzberg: Exploiting A History Database for Backup. VLDB 1993 : 380-390

David B. Lomet , Betty Salzberg: Transaction-Time Databases. Temporal Databases 1993 : 388-417

Georgios Evangelidis , Betty Salzberg: Using the Holy Brick Tree for Spatial Data in General Purpose DBMSs. IEEE Data Eng. Bull. 16 (3): 34-39 (1993)

David B. Lomet , Betty Salzberg: Access Method Concurrency with Recovery. SIGMOD Conference 1992 : 351-360

Betty Salzberg, Allyn Dimock : Principles of Transaction-Based On-Line Reorganization. VLDB 1992 : 511-520

Betty Salzberg, David B. Lomet : Spatial Database Access Methods. SIGMOD Record 20 (3): 5-15 (1991)

David B. Lomet , Betty Salzberg: The Performance of a Multiversion Access Method. SIGMOD Conference 1990 : 353-363

Betty Salzberg, Alex Tsukerman , Jim Gray , Michael Stewart , Susan Uren , Bonnie Vaughan : FastSort: A Distributed Single-Input Single-Output External Sort. SIGMOD Conference 1990 : 94-101

David B. Lomet , Betty Salzberg: The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance. ACM Trans. Database Syst. 15 (4): 625-658 (1990)

David B. Lomet , Betty Salzberg: A Robust Multi-Attribute Search Structure. ICDE 1989 : 296-304

David B. Lomet , Betty Salzberg: Access Methods for Multiversion Data. SIGMOD Conference 1989 : 315-324

Betty Salzberg: Merging Sorted Runs Using Large Main Memory. Acta Inf. 27 (3): 195-215 (1989)

Betty Salzberg: File Structures: An Analytic Approach. Prentice-Hall 1988

Betty Salzberg: Grid File Concurrency. Inf. Syst. 11 (3): 235-244 (1986)

Betty Salzberg: Third Normal Form Made Easy. SIGMOD Record 15 (4): 2-18 (1986)

1 [ 19 ]

2 [ 45 ]

3 [ 11 ]

4 [ 13 ] [ 20 ] [ 27 ]

5 [ 39 ] [ 43 ] [ 47 ]

6 [ 8 ] [ 19 ]

7 [ 39 ] [ 43 ] [ 47 ]

8 [ 45 ]

9 [ 47 ]

10 [ 40 ] [ 41 ] [ 42 ]

11 [ 34 ]

12 [ 40 ] [ 41 ] [ 42 ]

13 [ 5 ] [ 6 ] [ 7 ] [ 9 ] [ 10 ] [ 12 ] [ 14 ] [ 15 ] [ 20 ] [ 26 ] [ 27 ] [ 39 ] [ 43 ] [ 47 ]

14 [ 45 ]

15 [ 45 ]

16 [ 19 ]

17 [ 44 ] [ 47 ]

18 [ 8 ]

19 [ 25 ]

20 [ 37 ]

21 [ 8 ]

22 [ 8 ]

23 [ 8 ]

24 [ 45 ]

25 [ 19 ]

26 [ 45 ] [ 46 ]

27 [ 44 ] [ 46 ]

28 [ 21 ] [ 24 ] [ 33 ] [ 34 ]




©2004 Association for Computing Machinery