Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/645924.671346dlproceedingsArticle/Chapter ViewAbstractPublication PagesvldbConference Proceedingsconference-collections
Article

Proximity Search in Databases

Published: 24 August 1998 Publication History
  • Get Citation Alerts
  • Abstract

    No abstract available.

    References

    [1]
    {AHU74} Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6.
    [2]
    {AKR93} A. Agrawal, P. Klein, and R. Ravi. Cutting down on fill using nested dissection: provably good elimination orderings. In J. A. George, J. R. Gilbert, and J. Liu, editors, Sparse Matrix Computations: Graph Theory Issues and Algorithms, IMA Volumes in Mathematics and its applications, pages 31-55. Springer-Verlag, New York, 1993.
    [3]
    {Bod96} Hans L. Bodlaender: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput. 25(6): 1305-1317(1996).
    [4]
    {Con97} World Wide Web Consortium. Extensible markup language (XML). http://www.w3.org/ TR/WD-xml-lang-970331.html, December 1997. Proposed recommendation.
    [5]
    {CZ95} Shiva Chaudhuri, Christos D. Zaroliagis: Shortest Path Queries in Digraphs of Small Treewidth. ICALP 1995: 244- 255.
    [6]
    {DGEP98} Shaul Dar, Gadi Entin, Shai Geva, Eran Palmon: DTL's DataSpot: Database Exploration Using Plain Language. VLDB 1998: 645-649.
    [7]
    {Dij59} E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
    [8]
    {DM97} Stefan Deßloch, Nelson Mendonça Mattos: Integrating SQL Databases with Content-Specific Search Engines. VLDB 1997: 528-537.
    [9]
    {DR94} Shaul Dar, Raghu Ramakrishnan: A Performance Study of Transitive Closure Algorithms. SIGMOD Conference 1994: 454-465.
    [10]
    {Fag96} Ronald Fagin: Combining Fuzzy Information from Multiple Systems. PODS 1996: 216-226.
    [11]
    {Flo62} R. W. Floyd. Algorithm 97 (SHORTEST PATH). Communications of the ACM, 5(6):345, 1962.
    [12]
    {Goo61} I. J. Good. A causal calculus. British Journal of the Philosophy of Science, 11:305-318, 1961.
    [13]
    {GSVGM98} R. Goldman, N. Shivakumar, S. Venkatasubramanian, and H. Garcia-Molina. Proximity search in databases. (Extended Version). Technical Report, Stanford University. Available at http://www-db.stanford.edu/pub/papers/proximity.ps, 1998.
    [14]
    {HKRS94} Philip N. Klein, Satish Rao, Monika Rauch Henzinger, Sairam Subramanian: Faster shortest-path algorithms for planar graphs. STOC 1994: 27-37.
    [15]
    {KS} V. Kumar and E. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. Algorithmica. Submitted.
    [16]
    {LT80} Richard J. Lipton, Robert Endre Tarjan: Applications of a Planar Separator Theorem. SIAM J. Comput. 9(3): 615- 627(1980).
    [17]
    {MAG+97} Jason McHugh, Serge Abiteboul, Roy Goldman, Dallan Quass, Jennifer Widom: Lore: A Database Management System for Semistructured Data. SIGMOD Record 26(3): 54-66(1997).
    [18]
    {Ora97} Oracle Corp. Managing text with Oracle8 Con-Text cartridge. http://www.oracle.com/st/o8col- lateral/html/xctx5bwp.html, 1997. White paper.
    [19]
    {Pel97} D. Peleg. Proximity-preserving labelling schemes. Manuscript, 1997.
    [20]
    {PGMW95} Yannis Papakonstantinou, Hector Garcia-Molina, Jennifer Widom: Object Exchange Across Heterogeneous Information Sources. ICDE 1995: 251-260.
    [21]
    {Sal89} Gerard Salton: Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley 1989, ISBN 0-201-12227-8.
    [22]
    {Ull89} Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X.
    [23]
    {UY91} J. Ullman and M. Yannakakis. The input/output complexity of transitive closure. Annals of Mathematics and Artificial Intelligence 3, pages 331-360, 1991.
    [24]
    {ZMSD93} Justin Zobel, Alistair Moffat, Ron Sacks-Davis: Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files. VLDB 1993: 290-301.

    Cited By

    View all
    • (2014)Shortest-path queries in static networksACM Computing Surveys10.1145/253053146:4(1-31)Online publication date: 1-Mar-2014
    • (2013)A proximity-based fallback model for hybrid web recommender systemsProceedings of the 22nd International Conference on World Wide Web10.1145/2487788.2487948(389-394)Online publication date: 13-May-2013
    • (2012)A compact routing scheme and approximate distance oracle for power-law graphsACM Transactions on Algorithms10.1145/2390176.23901809:1(1-26)Online publication date: 26-Dec-2012
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image DL Hosted proceedings
    VLDB '98: Proceedings of the 24rd International Conference on Very Large Data Bases
    August 1998
    695 pages
    ISBN:1558605665

    Publisher

    Morgan Kaufmann Publishers Inc.

    San Francisco, CA, United States

    Publication History

    Published: 24 August 1998

    Qualifiers

    • Article

    Conference

    VLDB98

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 12 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2014)Shortest-path queries in static networksACM Computing Surveys10.1145/253053146:4(1-31)Online publication date: 1-Mar-2014
    • (2013)A proximity-based fallback model for hybrid web recommender systemsProceedings of the 22nd International Conference on World Wide Web10.1145/2487788.2487948(389-394)Online publication date: 13-May-2013
    • (2012)A compact routing scheme and approximate distance oracle for power-law graphsACM Transactions on Algorithms10.1145/2390176.23901809:1(1-26)Online publication date: 26-Dec-2012
    • (2012)A highway-centric labeling approach for answering distance queries on large sparse graphsProceedings of the 2012 ACM SIGMOD International Conference on Management of Data10.1145/2213836.2213887(445-456)Online publication date: 20-May-2012
    • (2011)Learning to rank results in relational keyword searchProceedings of the 20th ACM international conference on Information and knowledge management10.1145/2063576.2063820(1689-1698)Online publication date: 24-Oct-2011
    • (2011)Discovering top-k teams of experts with/without a leader in social networksProceedings of the 20th ACM international conference on Information and knowledge management10.1145/2063576.2063718(985-994)Online publication date: 24-Oct-2011
    • (2011)Organic databasesProceedings of the 7th international conference on Databases in Networked Information Systems10.1007/978-3-642-25731-5_5(49-63)Online publication date: 12-Dec-2011
    • (2010)Improving graph-walk-based similarity with rerankingACM Transactions on Information Systems10.1145/1877766.187777029:1(1-52)Online publication date: 27-Dec-2010
    • (2010)Discover hierarchical subgraphs with network-topology based ranking scoreProceedings of the Third C* Conference on Computer Science and Software Engineering10.1145/1822327.1822336(66-74)Online publication date: 19-May-2010
    • (2010)Fast ELCA computation for keyword queries on XML dataProceedings of the 13th International Conference on Extending Database Technology10.1145/1739041.1739107(549-560)Online publication date: 22-Mar-2010
    • Show More Cited By

    View Options

    View options

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media