Automated logical navigation among relations using Steiner trees

The use of the Steiner tree (or the shortest connection) as a model for automatic logical navigation among relations is described. An efficient approximation algorithm is introduced for finding shortest connections. The model is extended to allow for ambiguous words in queries. The capability of this method is demonstrated by a simple database interface which is both easy to build and easy to use. The method can also be used in other query systems as a tool for finding navigation routes.<<ETX>>

[1]  Naveed A. Sherwani,et al.  Switchbox Steiner tree problem in presence of obstacles , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[2]  Manuela Raith,et al.  A new hypergraph based rip-up and reroute strategy , 1991, 28th ACM/IEEE Design Automation Conference.

[3]  Somchai Prasitjutrakul,et al.  A timing-driven global router for custom chip design , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[4]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[5]  Pankaj K. Agarwal,et al.  Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle , 1990, Networks.

[6]  Tatsuo Ohtsuki,et al.  A hardware implementation of gridless routing based on content addressable memory , 1991, DAC '90.

[7]  Dana S. Richards,et al.  An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[9]  D. R. McGregor,et al.  Fast approximate string matching , 1988, Softw. Pract. Exp..

[10]  D. Hightower,et al.  A solution to line routing problems on the continuous plane , 1988 .

[11]  Alessandro De Gloria,et al.  A Tile-Expansion Router , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[13]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[14]  Victor J. Rayward-Smith,et al.  On finding steiner vertices , 1986, Networks.

[15]  Amihai Motro.  Constructing queries from tokens , 1986, SIGMOD '86.

[16]  Wojciech Maly,et al.  Modeling of Lithography Related Yield Losses for CAD of VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[17]  Witold Lipski,et al.  An O(n log n) Manhattan Path Algorithm , 1984, Inf. Process. Lett..

[18]  Jeffrey D. Ullman,et al.  SYSTEM/U: a database system based on the universal relation assumption , 1984, TODS.

[19]  Paul G. Sorenson,et al.  Resolving the query inference problem using Steiner trees , 1984, TODS.

[20]  John K. Ousterhout,et al.  A Switchbox Router with Obstacle Avoidance , 1984, 21st Design Automation Conference Proceedings.

[21]  David Maier,et al.  On the foundations of the universal relation model , 1984, TODS.

[22]  John E. Beasley.  An algorithm for the steiner problem in graphs , 1984, Networks.

[23]  John R. Anderson.  The Architecture of Cognition , 1983 .

[24]  Ronald L. Rivest,et al.  A "Greedy" Channel Router , 1988, 19th Design Automation Conference.

[25]  Ieee Circuits,et al.  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems information for authors , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[26]  Willy M. C. Sansen,et al.  A Line-Expansion Algorithm for the General Routing Problem with a Guaranteed Solution , 1980, 17th Design Automation Conference.

[27]  Yash P. Aneja,et al.  An integer linear programming approach to the steiner problem in graphs , 1980, Networks.

[28]  David L. Waltz,et al.  An English language question answering system for a large relational database , 1978, CACM.

[29]  Jiri Soukup,et al.  Fast Maze Router , 1978, 15th Design Automation Conference.

[30]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[31]  Frank O. Hadlock,et al.  A shortest path algorithm for grid graphs , 1977, Networks.

[32]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[33]  Ivan Dobes.  A multi-contouring algorithm , 1977, SIGD.

[34]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[35]  Michael Stonebraker,et al.  The design and implementation of INGRES , 1976, TODS.

[36]  F. Hwang.  On Steiner Minimal Trees with Rectilinear Distance , 1976 .

[37]  Jeffrey H. Hoel.  Some Variations of Lee's Algorithm , 1976, IEEE Transactions on Computers.

[38]  R. Close.  A reference grammar for students of English , 1975 .

[39]  F. Rubin,et al.  The Lee Path Connection Algorithm , 1974, IEEE Transactions on Computers.

[40]  Ludwig Nastansky,et al.  Cost-minimal trees in directed acyclic graphs , 1974, Z. Oper. Research.

[41]  A. Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC '71.

[42]  Robert B. Dial,et al.  Algorithm 360: shortest-path forest with topological ordering [H] , 1969, CACM.

[43]  Robert B. Hitchcock.  Cellular wiring and the cellular modeling technique , 1969, DAC '69.

[44]  Sam Heiss.  A path connection algorithm for multi-layer boards , 1968, DAC.

[45]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[46]  Kinya Tabuchi,et al.  A computer program for optimal routing of printed circuit conductors , 1968, IFIP Congress.

[47]  David L. Caskey,et al.  Topographic simulation as an aid to printed circuit board design , 1967, DAC.

[48]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[49]  James Doran,et al.  AN APPROACH TO AUTOMATIC PROBLEM -SOLVING , 1966 .

[50]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[51]  G. Dantzig.  On the Shortest Route Through a Network , 1960 .

[52]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[53]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

[54]  A. Orden.  The Transhipment Problem , 1956 .

[55]  W. C. Elmore.  The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers , 1948 .