Fandom

Scratchpad

Foundations, algorithms, theory bibliography

215,809pages on
this wiki
Add New Page
Discuss this page0 Share

Ad blocker interference detected!


Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.


2005

  • Early Hash Join: A Configurable Algorithm for the Efficient and Early Production of Join Results. Ramon Lawrence. VLDB 2005. (db algorithms)
  • Inspector Joins. Shimin Chen, Anastassia Ailamaki, Phillip B. Gibbons, Todd C. Mowry. VLDB 2005. (db algorithms)
  • Revisiting Pipelined Parallelism in Multi-Join Query Processing. Bin Liu, Elke A. Rundensteiner. VLDB 2005. (db algorithms)
  • SVM in Oracle Database 10g: Removing the Barriers to Widespread Adoption of Support Vector Machines. Boriana L. Milenova, Joseph Yarmus, Marcos Campos. VLDB 2005. (industrial, new data types and algorithms)
  • Supporting RFID-based Item Tracking Applications in Oracle DBMS Using a Bitmap Datatype. Ying Hu, Seema Sundara, Timothy Chorma, Jagannathan Srinivasan. VLDB 2005. (industrial, new data types and algorithms)
  • Temporal Management of RFID Data. Fusheng Wang, Peiya Liu. VLDB 2005. (industrial, new data types and algorithms)


2003

  • A Theory of Redo Recovery. David B. Lomet, Mark R. Tuttle. ACM SIGMOD Conference 2003. (formal foundations)
  • Formal semantics and analysis of object queries. Gavin M. Bierman. ACM SIGMOD Conference 2003. (formal foundations)


2001

  • Bit-Sliced Index Arithmetic. Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'Neil. ACM SIGMOD Conference 2001. (efficient computation)
  • Outlier Detection for High Dimensional Data. Charu C. Aggarwal, Philip S. Yu. ACM SIGMOD Conference 2001. (efficient computation)
  • Space-Efficient Online Computation of Quantile Summaries. Michael Greenwald, Sanjeev Khanna. ACM SIGMOD Conference 2001. (efficient computation)


1999

  • A Framework for Measuring Changes in Data Characteristics. Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishnan. PODS 1999. (database theory sampler)
  • Exact and Approximate Aggregation in Constraint Query. Michael Benedikt, Leonid Libkin. PODS 1999. (database theory sampler)
  • Least Expected Cost Query Optimization: An Exercise in Utility. Francis C. Chu, Joseph Y. Halpern, Praveen Seshadri. PODS 1999. (database theory sampler)
  • Minimal Data Upgrading to Prevent Inference and Association. Steven Dawson, Sabrina De Capitani di Vimercati, Patrick Lincoln, Pierangela Samarati. PODS 1999. (database theory sampler)


1998

  • A Multi-Similarity Algebra. Sibel Adali, Piero A. Bonatti, Maria Luisa Sapino, V. S. Subrahmanian. ACM SIGMOD Conference 1998. (algebras for new needs)
  • Catching the Boat with Strudel: Experiences with a Web-Site Management System. Mary F. Fernandez, Daniela Florescu, Jaewoo Kang, Alon Y. Levy, Dan Suciu. ACM SIGMOD Conference 1998. (algebras for new needs)
  • Efficient and Transparent Application Recovery in Client-Server Information Systems. David B. Lomet, Gerhard Weikum. ACM SIGMOD Conference 1998. (database algorithms)
  • Memory Management During Run Generation in External Sorting. Per-Åke Larson, Goetz Graefe. ACM SIGMOD Conference 1998. (database algorithms)
  • Replication, Consistency, and Practicality: Are These Mutually Exclusive. Todd A. Anderson, Yuri Breitbart, Henry F. Korth, Avishai Wool. ACM SIGMOD Conference 1998. (database algorithms)


1994

  • Approximate Analysis of Real-Time Database Systems. Jayant R. Haritsa. ICDE 1994. (analytical modeling)
  • Object Allocation in Distributed Databases and Mobile Computers. Yixiu Huang, Ouri Wolfson. ICDE 1994. (analytical modeling)
  • On a More Realistic Lock Contention Model and Its Analysis. Alexander Thomasian. ICDE 1994. (analytical modeling)


1992

  • A Spanning Tree Transitive Closure Algorithm. Shaul Dar, H. V. Jagadish. ICDE 1992. (algorithms)
  • An Efficient Object-based Algorithm for Spatial Searching, Insertion and Deletion. Jui-Tine Lee, Geneva G. Belford. ICDE 1992. (algorithms)
  • Hot-Spot Based Compostion Algorithm. Shu-Shang Wei, Yao-Nan Lien, Dik Lun Lee, Ten-Hwang Lai. ICDE 1992. (algorithms)
  • I/O-Efficiency of Shortest Path Algorithms: An Analysis. Bin Jiang. ICDE 1992. (algorithms)
  • Parallel Algorithms for Executing Joins on Cube-Conneced Multicomputers. Manuel A. Penaloza, Esen A. Ozkarahan. ICDE 1992. (algorithms)
  • Probabilistic Dignosis of Hot Spots. Kenneth Salem, Daniel Barbará, Richard J. Lipton. ICDE 1992. (algorithms)


1991

  • Algebraic Properties of Bag Data Types. Joseph Albert. VLDB 1991. (theory)
  • Constraint-Based Query Optimization for Spatial Databases. Richard Helm, Kim Marriott, Martin Odersky. PODS 1991. (data structures and algorithms)
  • Dynamic Constraints and Object Migration. Jianwen Su. VLDB 1991. (theory)
  • Mixed-Approach Algorithms for Transitive Closure. Håkan Jakobsson. PODS 1991. (data structures and algorithms)
  • Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves with Partial Expansions. Gabriel Matsliach. PODS 1991. (data structures and algorithms)
  • The Power of Methods With Parallel Semantics. Karl Denninghoff, Victor Vianu. VLDB 1991. (theory)
  • Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees. Otto Nurmi, Eljas Soisalon-Soininen. PODS 1991. (data structures and algorithms)


1989

  • A Compact Representation for File Versions: a preliminary report. Andrew P. Black, Charles H. Burris. ICDE 1989. (data structures and file organizations)
  • A Robust Multi-Attribute Search Structure. David B. Lomet, Betty Salzberg. ICDE 1989. (data structures and file organizations)
  • Key-Sequential Access Methods for Very Large Files Derived from Linear Hashing. Nabil I. Hachem, P. Bruce Berra. ICDE 1989. (data structures and file organizations)
  • Term Indexing for Retrieval by Unification. Haruo Yokota, Hajime Kitakami, Akira Hattori. ICDE 1989. (data structures and file organizations)


1988

  • Closed World Databases Opened Through Null Values. Georg Gottlob, Roberto Zicari. VLDB 1988. (database theory)
  • Enforcing Inclusion Dependencies and Referencial Integrity. Marco A. Casanova, Luiz Tucherman, Antonio L. Furtado. VLDB 1988. (database theory)
  • Implementing Queries and Updates on Universal Scheme Interfaces. Christophe Lécluse, Nicolas Spyratos. VLDB 1988. (database theory)


1987

  • A Population Analysis for Hierarchical Data Structures. Randal C. Nelson, Hanan Samet. ACM SIGMOD Conference 1987. (data structures and procedures)
  • Dependency Inference. Heikki Mannila, Kari-Jouko Räihä. VLDB 1987. (dependency theory)
  • Efficiently Supporting Procedures in Relational Database Systems. Timos K. Sellis. ACM SIGMOD Conference 1987. (data structures and procedures)
  • Independent Database Schemes under Functional and Inclusion Dependencies. Paolo Atzeni, Edward P. F. Chan. VLDB 1987. (dependency theory)
  • Integrity Checking in Deductive Databases. Robert A. Kowalski, Fariba Sadri, Paul Soper. VLDB 1987. (theoretical issues)
  • On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata. Maurizio Lenzerini, Paolo Nobili. VLDB 1987. (dependency theory)
  • The BANG File: A New Kind of Grid File. Michael Freeston. ACM SIGMOD Conference 1987. (data structures and procedures)
  • The Theory of Probabilistic Databases. Roger Cavallo, Michael Pittarelli. VLDB 1987. (theoretical issues)
  • Using Design Axioms and Topology to Model Database Semantics. Arno Siebes, Martin L. Kersten. VLDB 1987. (theoretical issues)


1986

  • Formal Properties of Net-Based Knowledge Representation Schemes. Paolo Atzeni, Douglas Stott Parker Jr.. ICDE 1986. (theory)
  • Inclusion Dependencies in Database Design. Heikki Mannila, Kari-Jouko Räihä. ICDE 1986. (theory)
  • Parameterized View Definition and Recursive Relations. Motomichi Toyama. ICDE 1986. (theory)


1985

  • Determining when a Structure is a Nested Relation. Patrick C. Fischer, Dirk Van Gucht. VLDB 1985. (database systems theory)
  • Hit Data Model Data Bases from the Functional Point of View. Jirí Zlatuska. VLDB 1985. (database systems theory)
  • Integrity Checking for Multiple Updates. Arding Hsu, Tomasz Imielinski. ACM SIGMOD Conference 1985. (database theory)
  • On Verification of Database Temporal Constraints. David Chenho Kung. ACM SIGMOD Conference 1985. (database theory)
  • On the Expressive Power of the Logical Data Model (Preliminary Report). Gabriel M. Kuper, Moshe Y. Vardi. ACM SIGMOD Conference 1985. (database theory)
  • Update Semantics for Incomplete Databases. Serge Abiteboul, Gösta Grahne. VLDB 1985. (database systems theory)


1984

  • A Data Manipulation Model: An Extension of the Alpha Expression. Isamu Kobayashi. VLDB 1984. (database theory)
  • A Less Costly Constraints Checking for Join Dependency. K. P. Tan. VLDB 1984. (database theory)
  • Comprehensive Approach to the Design of Relational Database Schemes. Catriel Beeri, Michael Kifer. VLDB 1984. (database theory)
  • Dependency Satisfaction in Databases with Incomplete Information. Gösta Grahne. VLDB 1984. (database theory)
  • Efficient Processing of Relational Calculus Expressions Using Range Query Theory. Dan E. Willard. ACM SIGMOD Conference 1984. (database theory)
  • Equivalence and Mapping of Database Schemes. Alessandro D'Atri, Domenico Saccà. VLDB 1984. (database theory)
  • Interval Queries on Object Histories: Extended Abstract. Seymour Ginsburg, Katsumi Tanaka. VLDB 1984. (database theory)
  • Line Graph of Gamma-Acyclic Database Schems and its Recognition Algorithm. Yun-zhou Zhu. VLDB 1984. (database theory)
  • On Complementary and Independent Mappings on Databases. Arthur M. Keller, Jeffrey D. Ullman. ACM SIGMOD Conference 1984. (database theory)
  • Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions. Edward P. F. Chan. ACM SIGMOD Conference 1984. (database theory)
  • Transactions in Relational Databases (Preliminary Report). Serge Abiteboul, Victor Vianu. VLDB 1984. (database theory)


1983

  • A New Characterization of Independence. Peter Honeyman, Edward Sciore. ACM SIGMOD Conference 1983. (universal relation systems)
  • Answering Queries in Relational Databases. Alessandro D'Atri, Marina Moscarini, Nicolas Spyratos. ACM SIGMOD Conference 1983. (database theory)
  • Designing Globally Consistent Network Schemas. Sharon McCure Kuck, Yehoshua Sagiv. ACM SIGMOD Conference 1983. (database theory)
  • Functional Dependencies on Cyclic Database Schemes. Kent Laver, Alberto O. Mendelzon, Marc H. Graham. ACM SIGMOD Conference 1983. (universal relation systems)
  • Incomplete Information and Dependencies in Relational Databases. Tomasz Imielinski, Witold Lipski Jr.. ACM SIGMOD Conference 1983. (database theory)
  • Windows on the World. David Maier, David Rozenshtein, David Scott Warren. ACM SIGMOD Conference 1983. (universal relation systems)


1982

  • A Systematic Approach to Relational Database Theory. Tomasz Imielinski, Witold Lipski Jr.. ACM SIGMOD Conference 1982. (theory)
  • A Technique for Translating States Between Database Schemata. Tomasz Imielinski, Witold Lipski Jr.. ACM SIGMOD Conference 1982. (theory)
  • Fast Methods for Testing Quantified Relational Calculus Assertions. Philip A. Bernstein, Barbara T. Blaustein. ACM SIGMOD Conference 1982. (theory)
  • Specifying Connections for a Universal Relation Scheme Database. David Maier, David Scott Warren. ACM SIGMOD Conference 1982. (theory)
  • Toward Logical Data Independence: A Relational Query Language Without Relations. David Maier, David Rozenshtein, Sharon C. Salveter, Jacob Stein, David Scott Warren. ACM SIGMOD Conference 1982. (theory)


1981

  • Algorithms for Acyclic Database Schemes. Mihalis Yannakakis. VLDB 1981. (data base theory)
  • Can We Use the Universal Instance Assumption Without Using Nulls. Yehoshua Sagiv. ACM SIGMOD Conference 1981. (data dependency theory)
  • Constraints on Null Values in Relational Databases. Billie S. Goldstein. VLDB 1981. (data base theory)
  • Independent Components of Databases. François Bancilhon, Nicolas Spyratos. VLDB 1981. (data base theory)
  • Join Graphs and Acyclic Database Schemes. Karen Chase. VLDB 1981. (data base theory)
  • On Representing Incomplete Information in a Relational Data Base. Tomasz Imielinski, Witold Lipski Jr.. VLDB 1981. (data base theory)
  • Real-World MVD's. Edward Sciore. ACM SIGMOD Conference 1981. (data dependency theory)
  • Systematic Derivation of Complementary Specifications. Paulo A. S. Veloso, José Mauro Volkmer de Castilho, Antonio L. Furtado. VLDB 1981. (data base theory)


1980

  • Extension Joins. Peter Honeyman. VLDB 1980. (relational dependency theory)
  • Functional Dependencies and Incomplete Information. Yannis Vassiliou. VLDB 1980. (relational dependency theory)
  • Inferences Involving Embedded Multivalued Dependencies and Transitive Dependencies. Douglas Stott Parker Jr., Kamran Parsaye-Ghomi. ACM SIGMOD Conference 1980. (data dependency theories)
  • The Interaction between Functional Dependencies and Template Dependencies. Fereidoon Sadri, Jeffrey D. Ullman. ACM SIGMOD Conference 1980. (data dependency theories)
  • What does Boyce-Codd Normal Form Do. Philip A. Bernstein, Nathan Goodman. VLDB 1980. (relational dependency theory)


1979

  • Algorithmic Applications for a new Result on Multivalued Dependencies. Douglas Stott Parker Jr., Claude Delobel. VLDB 1979. (theoretical aspects)
  • Application of Sub-Predicate Tests in Database Systems. Rudolf Munz, H.-J. Schneider, Frank Steyer. VLDB 1979. (theoretical aspects)
  • Distribution Models of Relations. T. H. Merrett, Ekow J. Otoo. VLDB 1979. (theoretical aspects)
  • Generalized Mutual Dependencies and the Decomposition of Database Relations. Alberto O. Mendelzon, David Maier. VLDB 1979. (theoretical aspects)
  • Multivalued Dependencies with Null Values in Relational Data Bases. Y. Edmund Lien. VLDB 1979. (theoretical aspects)
  • Normal Forms and Relational Database Operators. Ronald Fagin. ACM SIGMOD Conference 1979. (database dependency theory)
  • Program Development by Transformations Applied to Relational Database Queries. V. W. Setzer. VLDB 1979. (theoretical aspects)
  • Semantic Checking of Questions Expressed in Predicate Calculus Language. Robert Demolombe. VLDB 1979. (theoretical aspects)
  • Synthesizing Independent Database Schemas. Joachim Biskup, Umeshwar Dayal, Philip A. Bernstein. ACM SIGMOD Conference 1979. (database dependency theory)
  • Testing Implications of Data Dependencies (Abstract). David Maier, Alberto O. Mendelzon, Yehoshua Sagiv. ACM SIGMOD Conference 1979. (database dependency theory)
  • Towards a Universal Relation Interface. Sylvia L. Osborn. VLDB 1979. (theoretical aspects)


1978

  • A Sophisticate's Introduction to Database Normalization Theory. Catriel Beeri, Philip A. Bernstein, Nathan Goodman. VLDB 1978. (survey, data base theory and modeling)
  • Data Base Theory and Modeling - Theoretical and Practical Aspects. Claude Delobel. VLDB 1978. (survey, data base theory and modeling)
  • Efficient Optimization of a Class of Relational Expressions (Abstract). Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman. ACM SIGMOD Conference 1978. (formal topics)
  • Efficient Organization of Internal DBMS Structure. Peter M. Stocker. VLDB 1978. (panel, efficient organization of internal dbms structure)
  • First Order Logic Formalization for Functional, Multivalued and Mutual Dependencies. Jean-Marie Nicolas. ACM SIGMOD Conference 1978. (formal topics)


1977

  • A Consideration on Normal Form of Not-Necessarily-Normalized Relation in the Relational Data Model. Akifumi Makinouchi. VLDB 1977. (functional dependencies)
  • Data Base Design by Applied Data Synthesis. M. Vetter. VLDB 1977. (functional dependencies)
  • Decomposition and Composition of a Relational Database. Yuzuru Tanaka, Takao Tsuda. VLDB 1977. (functional dependencies)
  • Implementation of a Fuzzy-Set Theoretic Data Structure System (Abstract). Masaharu Mizumoto, Motohide Umano, Kokichi Tanaka. VLDB 1977. (theory of imprecise data)
  • On Semantic Issues Connected with Incomplete Information Data Bases (Abstract). Witold Lipski Jr.. VLDB 1977. (theory of imprecise data)
  • The Decomposition Versus Synthetic Approach to Relational Database Design. Ronald Fagin. VLDB 1977. (functional dependencies)


1975

  • A Unified Approach to Functional Dependencies and Relations. Philip A. Bernstein, J. Richard Swenson, Dennis Tsichritzis. ACM SIGMOD Conference 1975. (theoretical aspects)
  • Distribution-Dependent Hashing Functions and Their Characteristics. R. F. Deutscher, Paul G. Sorenson, J. Paul Tremblay. ACM SIGMOD Conference 1975. (theoretical aspects)
  • Finding Candidate Keys for Relational Data Bases. Raymond Fadous, John Forsyth. ACM SIGMOD Conference 1975. (theoretical aspects)
  • On the Semantics of the Relational Data Model. Hans Albrecht Schmid, J. Richard Swenson. ACM SIGMOD Conference 1975. (theoretical aspects)

Also on Fandom

Random wikia