Balakrishna R. Iyer

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Gautam Bhargava

> Home > Persons > Balakrishna R. Iyer

Publications

1996
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/icde/BhargavaGI96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icde/BhargavaGI96
Gautam Bhargava, Piyush Goel, Balakrishna R. Iyer:
Efficient Processing of Outer Joins and Aggregate Functions. ICDE 1996: 441-449
1995
[c26]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/cascon/BhargavaGI95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cascon/BhargavaGI95
Gautam Bhargava, Piyush Goel, Balakrishna R. Iyer:
Simplification of outer joins. CASCON 1995: 7
[c25]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/cascon/BhargavaGI95a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cascon/BhargavaGI95a
Gautam Bhargava, Piyush Goel, Balakrishna R. Iyer:
No regression algorithm for the enumeration of projections in SQL queries with joins and outer joins. CASCON 1995: 8
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/sigmod/BhargavaGI95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigmod/BhargavaGI95
Gautam Bhargava, Piyush Goel, Balakrishna R. Iyer:
Hypergraph Based Reorderings of Outer Join Queries with Complex Predicates. SIGMOD Conference 1995: 304-315

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.