The Kirchhoff indices of join networks
نویسندگان
چکیده
منابع مشابه
Mediator Join Indices
A mediator join index (MJI) is proposed to speed up Nway inter-database joins by reducing the amount of data transfer during evaluation. A family of algorithms, the Query Scrubbing Algorithms (QSA), are developed to maintainMJI and to evaluate queries usingMJI. QSA algorithms use query scrubbing to cope with update and query anomalies related to materialized views in the mediator context. Compa...
متن کاملRanked Join Indices
A plethora of data sources contain data entities that could be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ranking of the entities according to the values in the attribute domain. Commonly, users correlate such sources for query processing purposes through join operations. In query processing, it is desirable to incorporate u...
متن کاملThe Quasi-Wiener and the Kirchhoff Indices Coincide
In 1993 two novel distance-based topological indices were put forward. In the case of acyclic molecular graphs both are equal to the Wiener index, but both differ from it if the graphs contain cycles. One index is defined (Mohar, B.; Babić, D.; Trinajstić, N. J. Chem. Inf. Comput. Sci. 1993, 33, 153-154) in terms of eigenvalues of the Laplacian matrix, whereas the other is conceived (Klein, D. ...
متن کاملThe Kirchhoff indexes of some composite networks
In electric circuit theory, it is of great interest to compute the effective resistance between any pair of vertices of a network, as well as the Kirchhoff index. During the past decade these parameters have been applied in organic chemistry as natural structural indexes different from the usual ones in order to achieve an improvement in the discrimination between different molecules that have ...
متن کاملEfficient Temporal Join Processing Using Indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully scanned. Given the large data volumes created by the ever increasing time dimension, sequential scanning is prohibitive. This is especially true when the temporal join involves only parts of the joining relations (e.g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.09.017