Number of co-authors:13
Number of publications with 3 favourite co-authors:Stefan Edlund:2Stavros Christodoulakis:2Matthias Eichstaedt:1
Daniel Alexander Ford's 3 most productive colleagues in number of publications:Stavros Christodou..:16Jussi Myllymaki:6Qi Lu:3
go to course
UI Design Patterns for Successful Software
Starts the day after tomorrow !
go to course
Affordances: Designing Intuitive User Interfaces
92% booked. Starts in 3 days
Marc Hassenzahl explains the fascinating concept of User Experience and Experience Design. Commentaries by Don Norman, Eric Reiss, Mark Blythe, and Whitney Hess
User Experience and Experience Design !
Our Latest Books
The Social Design of Technical Systems: Building technologies for communities. 2nd Edition
by Brian Whitworth and Adnan Ahmad
Gamification at Work: Designing Engaging Business Software
by Janaki Mythily Kumar and Mario Herger
The Social Design of Technical Systems: Building technologies for communities
by Brian Whitworth and Adnan Ahmad
The Encyclopedia of Human-Computer Interaction, 2nd Ed.
by Mads Soegaard and Rikke Friis Dam
Daniel Alexander Ford
Publications by Daniel Alexander Ford (bibliography)
Edlund, Stefan, Ford, Daniel Alexander, Krishna, Vikas and Kambhampati, Sunitha (2003): Extending Groupware for OLAP: Where Did My Time Go?. In: ICEIS 2003 2003. pp. 47-54.
Ford, Daniel Alexander, Ruvolo, Joann, Edlund, Stefan, Myllymaki, Jussi, Kaufman, James H., Jackson, Jared and Gerlach, Martin (2001): Tempus Fugit: A System for Making Semantic Connections. In: Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management November 5-10, 2001, Atlanta, Georgia, USA. pp. 520-522. Available online
Teng, Shang-Hua, Lu, Qi, Eichstaedt, Matthias, Ford, Daniel Alexander and Lehman, Tobin J. (1999): Collaborative Web Crawling: Information Gathering/Processing over Internet. In: HICSS 1999 1999. . Available online
Ford, Daniel Alexander and Christodoulakis, Stavros (1991): Optimal Placement of High-Probability Randomly Retrieved Blocks on CLV Optical Discs. In ACM Transactions on Information Systems, 9 (1) pp. 1-30. Available online
Optimal data placement on a CLV (Constant Linear Velocity) format optical disc has as an objective the minimization of the expected access cost of data retrieval from the disc when the probabilities of access of data items may be different. The problem of optimal data placement for optical discs is both more important and more difficult than the corresponding problem on magnetic disks. A good data placement on optical discs is more important because data sets on optical discs such as WORM and CD ROM cannot be modified or moved once they are placed on the disc. Currently, even rewritable optical discs are best suited for applications that are archival in nature. The problem of optimal data placement on CLV format optical discs is more difficult, mainly because the useful storage space is not uniformly distributed across the disc surface (along a radius). This leads to a complicated positional performance trade-off not present for magnetic disks. We present a model that encompasses all the important aspects of the placement problem on CLV format optical discs. The model takes into account the nonuniform distribution of useful storage, the dependency of the rotational delay on disc position, a parameterized seek cost function for optical discs, and the varying access probabilities of data items. We show that the optimal placement of high-probability blocks satisfies a unimodality property. Based on this observation, we solve the optimal placement problem. We then study the impact of the relative weights of the problem parameters and show that the optimal data placement may be very different from the optimal data placement on magnetic disks. We also validate our model and analysis and give an algorithm for computing the placement of disc sectors.
© All rights reserved Ford and Christodoulakis and/or ACM Press
Christodoulakis, Stavros and Ford, Daniel Alexander (1989): File Organizations and Access Methods for CLV Optical Discs. In: Proceedings of the Twelfth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1989. pp. 152-159.
A large and important class of optical disc technology are CLV format discs such as CD ROM and WORM. In this paper, we examine the issues related to the implementation and performance of several different file organizations on CLV format optical discs such as CD ROM and WORM. The organizations examined are based on hashing and trees. The CLV recording scheme is shown to be a good environment for efficiently implementing hashing. Single seek access and storage utilization levels approaching 100% can be achieved for CD ROM's. It is shown that a B-tree organization is not a good choice for WORM discs (both CAV and CLV), but a modified ISAM approach can be appropriate for WORM discs. We describe clustered BIM's, a class of tree organizations appropriate for CD ROMS. Expressions for the expected retrieval performance of both hashing and trees are also given. The paper concludes by outlining recent results and future directions on buffered implementations of access methods for WORM discs, as well as advantages of signature based access methods for text retrieval in WORM disc architectures.
© All rights reserved Christodoulakis and Ford and/or ACM Press
Join our community and advance:
Page maintainer: The Editorial Team