John G. Kollias

39 papers Journal 38
YearRankTypeTitle / Venue / Authors
1990 J jnl
Implementation of Overlapping B-Trees for Time and Space Efficient Representation of Collections of Similar Files.
Comput. J.
F. Warren Burton, John G. Kollias, D. G. Matsakis, V. G. Kollias
1990 J jnl
Optimal Data Placement in Two-Headed Disk Systems.
BIT
Yannis Manolopoulos, John G. Kollias
1990 J jnl
The Optimum Execution Order of Queries in Linear Storage.
Inf. Process. Lett.
John G. Kollias, Yannis Manolopoulos, Christos H. Papadimitriou
1989 J jnl
Expressions for Completely and Partly Unsuccessful Batched Search of Sequential and Tree-Structured Files.
IEEE Trans. Software Eng.
Yannis Manolopoulos, John G. Kollias
1989 J jnl
Functional Programming with Quadtrees.
IEEE Softw.
F. Warren Burton, John G. Kollias
1989 J jnl
Performance of a Two-Headed Disk System when Serving Database Queries Under the Scan Policy.
ACM Trans. Database Syst.
Yannis Manolopoulos, John G. Kollias
1989 J jnl
Triply Chained Tree: An Enhancement of Doubly Chained Tree.
Angew. Inform.
G. M. Famelis, Michael Hatzopoulos, John G. Kollias
1988 J jnl
Estimating Disk Head Movement in Batched Searching.
BIT
Yannis Manolopoulos, John G. Kollias
1988 J jnl
Reduction of Storage Requirements by Sharing Common Information in an Office Information System.
Angew. Inform.
F. Warren Burton, John G. Kollias
1987 J jnl
A General PASCAL Program for Map Overlay of Quadtrees and Related Problems.
Comput. J.
F. Warren Burton, V. J. Kollias, John G. Kollias
1987 J jnl
Batched Interpolation Search.
Comput. J.
Yannis Manolopoulos, John G. Kollias, F. Warren Burton
1986 J jnl
Real-Time Raster to Quadtree and Quadtree to Raster Conversion Algorithms with Modest Storage Requirements.
Angew. Inform.
F. Warren Burton, V. J. Kollias, John G. Kollias
1986 J jnl
Sequential vs. Binary Batched Searching.
Comput. J.
Yannis Manolopoulos, John G. Kollias, Michael Hatzopoulos
1985 J jnl
Expected and worst-case storage requirements for quadtrees.
Pattern Recognit. Lett.
F. Warren Burton, Vassiliki J. Kollias, John G. Kollias
1985 J jnl
Multiple Generation Text Files Using Overlapping Tree Structures.
Comput. J.
F. Warren Burton, Matthew M. Huntbach, John G. Kollias
1985 J jnl
On the Selection of a Reduced Set of Indexes.
Comput. J.
Michael Hatzopoulos, John G. Kollias
1985 J jnl
Towards the Optimal Secondary Index Organisation and Secondary Index Selection.
Comput. J.
Michael Hatzopoulos, John G. Kollias
1984 J jnl
An implementation of the exponential pyramid data structure with application to determination of symmetries in pictures.
Comput. Vis. Graph. Image Process.
F. Warren Burton, John G. Kollias, Nikitas A. Alexandridis
1984 J jnl
Consistency in Point-in-Point Polygon Tests.
Comput. J.
F. Warren Burton, V. J. Kollias, John G. Kollias
1984 J jnl
On the Optimal Incorporation of the Differential File Into a New Generation of the Database.
Angew. Inform.
Michael Hatzopoulos, John G. Kollias, V. J. Kollias
1984 J jnl
On the Optimal Selection of Multilist Database Structures.
IEEE Trans. Software Eng.
Michael Hatzopoulos, John G. Kollias
1983 J jnl
A dynamic model for the optimal selection of secondary indexes.
Inf. Syst.
Michael Hatzopoulos, John G. Kollias
1983 J jnl
The Effect of Missing, Retroactive, Erroneous and/or Late Data in Designing Accounting Applications.
Comput. J.
John G. Kollias
1982 J jnl
Maintaining the Initial Performance of a Network Structure.
Angew. Inform.
Michael Hatzopoulos, John G. Kollias
1982 J jnl
The Determination of the Optimum Database Maintenance Points.
Comput. J.
Michael Hatzopoulos, John G. Kollias
1981 J jnl
Allocation of copies of s distinct files in an information network.
Inf. Syst.
John G. Kollias, Michael Hatzopoulos
1981 J jnl
Criteria to Aid in Solving the Problem of Allocating Copies of a File in a Computer Network.
Comput. J.
John G. Kollias, Michael Hatzopoulos
1981 J jnl
Optimal Policy for Database Backup and Recovery.
Inf. Process. Lett.
Michael Hatzopoulos, John G. Kollias
1981 J jnl
The Application of a Number of Differential Files to the Maintenance of Large Databases.
Angew. Inform.
Michael Hatzopoulos, John G. Kollias, V. J. Kollias
1980 J jnl
Database maintenance efficiency using differential files.
Inf. Syst.
V. J. Kollias, Michael Hatzopoulos, John G. Kollias
1980 J jnl
Some Rules for Introducing Indexing Paths in a Primary File.
Comput. J.
Michael Hatzopoulos, John G. Kollias
1980 J jnl
The Reorganization of Multilist Database Structures.
Angew. Inform.
Michael Hatzopoulos, John G. Kollias
1980 J jnl
The file allocation problem under dynamic usage.
Inf. Syst.
Michael Hatzopoulos, John G. Kollias
1979 J jnl
A heuristic approach for determining the optimal degree of file inversion.
Inf. Syst.
John G. Kollias
1979 J jnl
File organizations and their reorganization.
Inf. Syst.
John G. Kollias
1979 J jnl
Optimising Disc Head Movements in Secondary Key Retrievals.
Comput. J.
F. Warren Burton, John G. Kollias
1978 J jnl
An Estimate of Seek Time for Batched Searching of Random or Index Sequential Structured Files.
Comput. J.
John G. Kollias
1977 J jnl
Improving the Performance of an Intelligent Data Management System.
Comput. J.
John G. Kollias, Peter M. Stocker, Peter A. Dearnley
1976 — —
The Design of Data Base Management Systems Using Linear Programming Techniques.
John G. Kollias