Theory of linear and integer programming
Theory of linear and integer programming
Randomized algorithms
Improved algorithms for topic distillation in a hyperlinked environment
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
Finding authorities and hubs from link structures on the World Wide Web
Proceedings of the 10th international conference on World Wide Web
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Stable algorithms for link analysis
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Database Systems: The Complete Book
Database Systems: The Complete Book
PageRank, HITS and a unified framework for link analysis
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Clustering Categorical Data: An Approach Based on Dynamical Systems
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Supporting Incremental Join Queries on Ranked Inputs
Proceedings of the 27th International Conference on Very Large Data Bases
SimRank: a measure of structural-context similarity
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Algorithms and applications for answering ranked queries using ranked views
The VLDB Journal — The International Journal on Very Large Data Bases
Supporting top-k join queries in relational databases
The VLDB Journal — The International Journal on Very Large Data Bases
Objectrank: authority-based keyword search in databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Electricity based external similarity of categorical attributes
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
Page quality: in search of an unbiased web ranking
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Bridging the gap between OLAP and SQL
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Center-piece subgraphs: problem definition and fast solutions
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Query result ranking over e-commerce web databases
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Fast direction-aware proximity for graph mining
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Authority-based keyword search in databases
ACM Transactions on Database Systems (TODS)
Accuracy estimate and optimization techniques for SimRank computation
Proceedings of the VLDB Endowment
C-DEM: a multi-modal query system for Drosophila Embryo databases
Proceedings of the VLDB Endowment
Fast mining of complex time-stamped events
Proceedings of the 17th ACM conference on Information and knowledge management
Learning Preferences with Hidden Common Cause Relations
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
P-Rank: a comprehensive structural similarity measure over information networks
Proceedings of the 18th ACM conference on Information and knowledge management
iPoG: fast interactive proximity querying on graphs
Proceedings of the 18th ACM conference on Information and knowledge management
Accuracy estimate and optimization techniques for SimRank computation
The VLDB Journal — The International Journal on Very Large Data Bases
Data & Knowledge Engineering
Metric forensics: a multi-level approach for mining volatile graphs
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast active exploration for link-based preference learning using Gaussian processes
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Diversified ranking on large graphs: an optimization viewpoint
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Local computation of PageRank: the ranking side
Proceedings of the 20th ACM international conference on Information and knowledge management
LocalRank: ranking web pages considering geographical locality by integrating web and databases
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
BASSET: scalable gateway finder in large graphs
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
How to tame a very large ER diagram (using link analysis and force-directed drawing algorithms)
ER'05 Proceedings of the 24th international conference on Conceptual Modeling
Gateway finder in large graphs: problem definitions and fast solutions
Information Retrieval
E-rank: A Structural-Based Similarity Measure in Social Networks
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
| Hi-index | 0.00 |
Link analysis methods show that the interconnections between web pages have lots of valuable information. The link analysis methods are, however, inherently oriented towards analyzing binary relations. We consider the question of generalizing link analysis methods for analyzing relational databases. To this aim, we provide a generalized ranking framework and address its practical implications. More specically, we associate with each relational database and set of queries a unique weighted directed graph, which we call the database graph. We explore the properties of database graphs. In analogy to link analysis algorithms, which use the Web graph to rank web pages, we use the database graph to rank partial tuples. In this way we can, e.g., extend the PageRank link analysis algorithm to relational databases and give this extension a random querier interpretation. Similarly, we extend the HITS link analysis algorithm to relational databases. We conclude with some preliminary experimental results.