The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
ObjectRank
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Automatic text processing: the transformation, analysis, and retrieval of information by computer
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0351 · Cited by 3,188
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Scaling personalized web search
Jeh, G., & Widom, J. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775191 · Cited by 1,195
Optimal aggregation algorithms for middleware
Fagin, R., Lotem, A., & Naor, M. (2001) · Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/375551.375567 · Cited by 1,086
Data on the Web from relations to semistructured data and XML
Abiteboul, S., Buneman, P., & Suciu, D. M. (2000) · Cited by 1,062
Cited by
PathSim: meta path-based top-K similarity search in heterogeneous information networks
Sun, Y., Han, J., Yan, X., Yu, P. S., & Wu, T. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/3402707.3402736 · Cited by 1,870
Gleich, D. F. (2015) · SIAM Review · doi:10.1137/140976649 · Cited by 646
Relational retrieval using a combination of path-constrained random walks
Lao, N., & Cohen, W. W. (2010) · Machine Learning · doi:10.1007/s10994-010-5205-8 · Cited by 614
Random walk with restart: fast solutions and applications
Tong, H., Faloutsos, C., & Pan, J.-Y. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0094-2 · Cited by 384
Effective keyword search in relational databases
Liu, F., Yu, C., Meng, W., & Chowdhury, A. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142536 · Cited by 355
Metadata
- Authors
- Balmin, A., Hristidis, V., & Papakonstantinou, Y.
- Venue
- Proceedings 2004 VLDB Conference
- Publisher
- Elsevier
- Published
- 2004
- Pages
- 564-575
- OpenAlex
- W1539585011
- Cited by
- 452
- References
- 21
- FWCI
- 22.12
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: ObjectRank. https://app.cochat.ai/papers/10.1016/b978-012088469-8.50051-6
- The paper
- Balmin, A., Hristidis, V., & Papakonstantinou, Y. (2004). ObjectRank. Proceedings 2004 VLDB Conference. https://doi.org/10.1016/b978-012088469-8.50051-6
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.