More Web Proxy on the site http://driver.im/

Article

Free access

Blocking for external graph searching

Authors:

Mark H. Nodine,

Michael T. Goodrich,

Jeffrey Scott VitterAuthors Info & Claims

PODS '93: Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Pages 222 - 232

https://doi.org/10.1145/153850.153880

Published: 01 August 1993 Publication History

Abstract

In this paper, we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented any number of times on the disk in order to take advantage of redundancy. We give matching upper and lower bounds for complete d-ary trees and d-dimensional grid graphs, as well as for classes of general graphs that intuitively speaking have a close to uniform number of neighbors around each vertex. We also show that for the special case of grid graphs blocked with isothetic hypercubes, there is a provably better speed-up if even a small amount of redundancy is permitted.

References

[1]

Alok Aggarwal and James Park, "Notes on Searching in Multidimensional Monotone Arrays," Proceedings of 29#h Annual IEEE Symposium on Foundations of Computer Science (October 1988), 497-512.

[2]

Romas Aleliunas and Arnold L. Rosenberg, "On Embedding Rectangular Grids in Square Grids," IEEE Transactzons on Computers C- 31 (1982), 907-913.

Digital Library

[3]

Claude Berge, Graphs and Hypergraphs (second edition), North-Holland Publishing Company, Amsterdam, 1976.

Digital Library

[4]

Allan Borodin, Sandy Irani, Prabhakar Raghavan, and Baruch Schieber, "Competitive Paging with Locality of Reference," Proc. of the 23rd ACM Symposzum on Theory of Computing (May 1991), 249-259.

Digital Library

[5]

F.R.K. Chung, A. L. Rosenberg, and Lawrence Snyder, "Perfect Storage Representations for Families of Data Structures," SIAM J. Algorithms and Discrete Methods 4(1983), 548- 565.

Digital Library

[6]

Richard A. DeMillo, Stanley C. Eisenstat, and Richard J. Lipton, "Preserving Average Proximity in Arrays," Communication of the ACM 21(1978), 228-231.

Digital Library

[7]

Michael R. Garey and David S. Johnson, Computers and Intractability: A Guide #o the Theory of NP.Completeness, W. H. Freeman & Co., New York, 1979.

Digital Library

[8]

Edmund Ihler, "Bounds on the Quality of Approximate Solutions to the Group Steiner Problem," in Graph-Theoretic Concepts in Computer Science, Proceedings of #he 16th International Workshop WG '90, G. Goos and J. Hartmanis, eds., Lecture Notes in Computer Science#484, Springer-Verlag, Berlin, 1991, 109-118.

Digital Library

[9]

Donald E. Knuth, in The Art of Computer Programming, Volume 3: Sorting and Searching, Addison-Wesley, Reading, MA, 1973.

Digital Library

[10]

R. J. Lipton, S. C. Eisenstat, and R. A. De- Millo, "Space and Time Hierarchies for Classes of Control Structures and Data Structures," J. Association for Computing Machznery 23 (1976), 720-732.

Digital Library

[11]

Gabriele Reich and Peter Widmayer, "Beyond Steiner's Problem: A VLSI Oriented Generalization," in Graph-Theoretic Comcepts in Computer Science: Proceedings of the 15th International Workshop WG '89, G. Goos and J. Hartmanis, eds., Lecture Notes in Computer Science #411, Springer-Verlag, New York, 1990, 196-210.

Digital Library

[12]

Arnold L. Rosenberg, "Preserving Proximity in Arrays," SIAM J. Comput. 4 (1975), 443-460.

Digital Library

[13]

Arnold L. Rosenberg, "Data Encodings and Their Costs," Acta Informatica 9(1978), 273- 292.

Digital Library

[14]

Arnold L. Rosenberg, "Encoding Data Structures in Trees," J. Association for Computing Machinery 26 (1979), 668-689.

Digital Library

[15]

Arnold L. Rosenberg and Lawrence Snyder, "Bounds on the Costs of Data Encodings," Math. Systems Theory 12 (1978), 9-39.

[16]

Jeffrey D. Ullman, in Principles of Database and Knowledge-Base Systems, Computer Science Press, Rockville, MD, 1988.

Digital Library

[17]

Jeffrey D. Ullman and Mihalis Yannakakis, "The Input/Output Complexity of Transitive Closure," Annals of Mathematics and Artificial Intelligence (1991), 331-360.

Cited By

Harshvardhan West BFidel AAmato NRauchwerger L(2015)A Hybrid Approach to Processing Big Data Graphs on Memory-Restricted SystemsProceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium10.1109/IPDPS.2015.28(799-808)Online publication date: 25-May-2015
https://dl.acm.org/doi/10.1109/IPDPS.2015.28
Roh KCrochemore MIliopoulos CPark K(2008)External Memory Algorithms for String ProblemsFundamenta Informaticae10.5555/2365293.236529684:1(17-32)Online publication date: 1-Jan-2008
https://dl.acm.org/doi/10.5555/2365293.2365296
Roh KCrochemore MIliopoulos CPark K(2008)External Memory Algorithms for String ProblemsFundamenta Informaticae10.5555/1402623.140262684:1(17-32)Online publication date: 1-Jan-2008
https://dl.acm.org/doi/10.5555/1402623.1402626
Show More Cited By

Index Terms

Blocking for external graph searching

Recommendations

Planar Graph Blocking for External Searching

We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves the previous results for planar graphs with bounded face size. We also ...
Graph searching
Blocking for External Graph Searching

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '93: Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

August 1993

312 pages

ISBN:0897915933

DOI:10.1145/153850

Chairman:
Catriel Beeri

Copyright © 1993 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS93

Sponsor:

SIGMOD/PODS93: Joint ACM SIGMOD International Conference on Management of Data and ACM SIGMOD

May 25 - 28, 1993

D.C., Washington, USA

Acceptance Rates

PODS '93 Paper Acceptance Rate 26 of 115 submissions, 23%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
329
Total Downloads

Downloads (Last 12 months)47
Downloads (Last 6 weeks)12

Reflects downloads up to 12 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Harshvardhan West BFidel AAmato NRauchwerger L(2015)A Hybrid Approach to Processing Big Data Graphs on Memory-Restricted SystemsProceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium10.1109/IPDPS.2015.28(799-808)Online publication date: 25-May-2015
https://dl.acm.org/doi/10.1109/IPDPS.2015.28
Roh KCrochemore MIliopoulos CPark K(2008)External Memory Algorithms for String ProblemsFundamenta Informaticae10.5555/2365293.236529684:1(17-32)Online publication date: 1-Jan-2008
https://dl.acm.org/doi/10.5555/2365293.2365296
Roh KCrochemore MIliopoulos CPark K(2008)External Memory Algorithms for String ProblemsFundamenta Informaticae10.5555/1402623.140262684:1(17-32)Online publication date: 1-Jan-2008
https://dl.acm.org/doi/10.5555/1402623.1402626
Callahan PGoodrich MRamaiyer K(2005)Topology B-trees and their applicationsAlgorithms and Data Structures10.1007/3-540-60220-8_78(381-392)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-60220-8_78
Feuerstein E(2005)Paging more than one pageLATIN '95: Theoretical Informatics10.1007/3-540-59175-3_95(272-285)Online publication date: 6-Jun-2005
https://doi.org/10.1007/3-540-59175-3_95
Feuerstein EMarchetti-Spaccamela A(2005)Memory paging for connectivity and path problems in graphsAlgorithms and Computation10.1007/3-540-57568-5_273(416-425)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-57568-5_273
Varadhan GManocha DPfister HBailey MSwan JThomas J(2002)Out-of-core rendering of massive geometric environmentsProceedings of the conference on Visualization '0210.5555/602099.602108(69-76)Online publication date: 27-Oct-2002
https://dl.acm.org/doi/10.5555/602099.602108
Varadhan GManocha D(2002)Out-of-core rendering of massive geometric environmentsIEEE Visualization, 2002. VIS 2002.10.1109/VISUAL.2002.1183759(69-76)Online publication date: 2002
https://doi.org/10.1109/VISUAL.2002.1183759
Nanopoulos AManolopoulos Y(2001)Mining patterns from graph traversalsData & Knowledge Engineering10.1016/S0169-023X(01)00008-837:3(243-266)Online publication date: 1-Jun-2001
https://dl.acm.org/doi/10.1016/S0169-023X%2801%2900008-8
Nanopoulos AManolopoulos Y(2001)Finding Generalized Path Patterns for Web Log Data MiningCurrent Issues in Databases and Information Systems10.1007/3-540-44472-6_17(215-228)Online publication date: 1-Jun-2001
https://doi.org/10.1007/3-540-44472-6_17

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents