Article

ObjectRank: a system for authority-based search on databases

Authors:

Heasoo Hwang,

Vagelis Hristidis,

Yannis PapakonstantinouAuthors Info & Claims

SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data

Pages 796 - 798

https://doi.org/10.1145/1142473.1142593

Published: 27 June 2006 Publication History

Get Access

Abstract

We present ObjectRank demo system that performs authority-based keyword search on bibliographic databases. We also provide Inverse ObjectRank as a keyword-specific specificity metric and other calibration parameters such as Global ObjectRank. Users can specify various combinations of calibration values to control the behavior of the demo. Finally, we propose a methodology that enables us to extend query results using the ontology graph.

References

[1]

A. Balmin, V. Hristidis, and Y. Papakonstantinou. ObjectRank: Authority-Based Keyword Search in Databases. VLDB, 2004.

Digital Library

Google Scholar

[2]

A. Balmin, V. Hristidis, and Y. Papakonstantinou. ObjectRank: Authority-Based Keyword Search in Databases (extended version). UCSD Technical Report, 2004.

Google Scholar

[3]

S. Brin and L. Page. The Anatomy of a Large-Scale Hypertextual Web Search Engine. WWW Conference, 1998.

Digital Library

Google Scholar

[4]

V. Hristidis, H. Hwang, and Y. Papakonstantinou. Authority-Based Keyword Search in Databases. under preparation for journal submission, 2006.

Google Scholar

[5]

R. Ramakrishnan and J. Gehrke. Database Management Systems. Third Edition. McGraw-Hill Book Co, 2003.

Digital Library

Google Scholar

Cited By

View all

Berend G(2020)Efficient algorithm to compute Markov transitional probabilities for a desired PageRankEPJ Data Science10.1140/epjds/s13688-020-00240-z9:1Online publication date: 29-Jul-2020
https://doi.org/10.1140/epjds/s13688-020-00240-z
Mohanty MRamanath MZhu WTao DCheng XCui PRundensteiner ECarmel DHe QXu Yu J(2019)Insta-SearchProceedings of the 28th ACM International Conference on Information and Knowledge Management10.1145/3357384.3357858(2909-2912)Online publication date: 3-Nov-2019
https://dl.acm.org/doi/10.1145/3357384.3357858
Mohanty MRamanath MRanu SGanguly NRamakrishnan RSarawagi SRoy S(2018)KlustreeProceedings of the ACM India Joint International Conference on Data Science and Management of Data10.1145/3152494.3152509(265-272)Online publication date: 11-Jan-2018
https://dl.acm.org/doi/10.1145/3152494.3152509
Show More Cited By

Index Terms

ObjectRank: a system for authority-based search on databases
1. Information systems
  1. Information retrieval
  2. Information storage systems

Recommendations

Objectrank: authority-based keyword search in databases
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

The ObjectRank system applies authority-based ranking to keyword search in databases modeled as labeled graphs. Conceptually, authority originates at the nodes (objects) containing the keywords and flows to objects according to their semantic ...
FORK: Feedback-Aware ObjectRank-Based Keyword Search over Linked Data
Information Retrieval Technology
Abstract
Ranking quality for keyword search over Linked Data (LD) is crucial when users look for entities from LD, since datasets in LD have complicated structures as well as much contents. This paper proposes a keyword search method, FORK, which ranks ...
A Local Method for ObjectRank Estimation
IIWAS '13: Proceedings of International Conference on Information Integration and Web-based Applications & Services

ObjectRank is a method of link structure analysis to evaluate the importance of objects in a database. ObjectRank is known to be computationally expensive, because it requires iterative computations over a large graph. However, in many real applications,...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data

June 2006

830 pages

ISBN:1595934340

DOI:10.1145/1142473

General Chairs:
Clement Yu
University of Illinois at Chicago
,
Peter Scheuermann
Northwestern University
,
Program Chair:
Surajit Chaudhuri
Microsoft Research

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 June 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS06

Sponsor:

SIGMOD/PODS06: International Conference on Management of Data and Symposium on Principles Database and Systems

June 27 - 29, 2006

IL, Chicago, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

28
Total Citations
View Citations
467
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Berend G(2020)Efficient algorithm to compute Markov transitional probabilities for a desired PageRankEPJ Data Science10.1140/epjds/s13688-020-00240-z9:1Online publication date: 29-Jul-2020
https://doi.org/10.1140/epjds/s13688-020-00240-z
Mohanty MRamanath MZhu WTao DCheng XCui PRundensteiner ECarmel DHe QXu Yu J(2019)Insta-SearchProceedings of the 28th ACM International Conference on Information and Knowledge Management10.1145/3357384.3357858(2909-2912)Online publication date: 3-Nov-2019
https://dl.acm.org/doi/10.1145/3357384.3357858
Mohanty MRamanath MRanu SGanguly NRamakrishnan RSarawagi SRoy S(2018)KlustreeProceedings of the ACM India Joint International Conference on Data Science and Management of Data10.1145/3152494.3152509(265-272)Online publication date: 11-Jan-2018
https://dl.acm.org/doi/10.1145/3152494.3152509
Zhou YLiu LSeshadri SChiu L(2016)Analyzing Enterprise Storage Workloads With Graph Modeling and ClusteringIEEE Journal on Selected Areas in Communications10.1109/JSAC.2016.252547834:3(551-574)Online publication date: Mar-2016
https://doi.org/10.1109/JSAC.2016.2525478
Cooray TWikramanayake G(2015)An approach for transforming keyword-based queries to SPARQL on RDF data source federations2015 Fifteenth International Conference on Advances in ICT for Emerging Regions (ICTer)10.1109/ICTER.2015.7377684(168-175)Online publication date: Aug-2015
https://doi.org/10.1109/ICTER.2015.7377684
Zhou YSeshadri SChiu LLiu L(2014)GraphLensProceedings of the 2014 IEEE International Congress on Big Data10.1109/BigData.Congress.2014.11(1-8)Online publication date: 27-Jun-2014
https://dl.acm.org/doi/10.1109/BigData.Congress.2014.11
Jindal VBawa SBatra S(2014)A review of ranking approaches for semantic search on WebInformation Processing and Management: an International Journal10.1016/j.ipm.2013.10.00450:2(416-425)Online publication date: 1-Mar-2014
https://dl.acm.org/doi/10.1016/j.ipm.2013.10.004
Yu JZeng XCheng J(2013)Top-k graph pattern matching over large graphsProceedings of the 2013 IEEE International Conference on Data Engineering (ICDE 2013)10.1109/ICDE.2013.6544895(1033-1044)Online publication date: 8-Apr-2013
https://dl.acm.org/doi/10.1109/ICDE.2013.6544895
Lu JLu J(2013)LCRA, XML Keyword Search System, and LotusX, Graphical Query Processing SystemAn Introduction to XML Query Processing and Keyword Search10.1007/978-3-642-34555-5_8(267-283)Online publication date: 28-Jan-2013
https://doi.org/10.1007/978-3-642-34555-5_8
Zhai JShen DKou YNie T(2012)Richly Semantical Keyword Searching over Relational DatabasesProceedings of the 2012 Ninth Web Information Systems and Applications Conference10.1109/WISA.2012.10(211-216)Online publication date: 16-Nov-2012
https://dl.acm.org/doi/10.1109/WISA.2012.10
Show More Cited By

View Options

Login options

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

Cited By

Index Terms

Recommendations

Objectrank: authority-based keyword search in databases

FORK: Feedback-Aware ObjectRank-Based Keyword Search over Linked Data

A Local Method for ObjectRank Estimation