Databases Theory and Applications
30th Australasian Database Conference, ADC 2019, Sydney, NSW, Australia, January 29 – February 1, 2019, Proceedings
Page
%P
-
Article
Open AccessIdentifying similar-bicliques in bipartite graphs
Bipartite graphs have been widely used to model the relationship between entities of different types, where vertices are partitioned into two disjoint sets/sides. Finding dense subgraphs in a bipartite graph i...
-
Chapter and Conference Paper
On Directed Densest Subgraph Detection
The well-studied directed densest subgraph problem aims to find two (possibly overlap**) vertex subsets \(S^*\) ...
-
Article
Open AccessA near-optimal approach to edge connectivity-based hierarchical graph decomposition
The problem of efficiently computing all \(k\) k -edge-connected components ...
-
Article
When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks
Computing the shortest distance between two vertices is a fundamental problem in road networks. Since a direct search using the Dijkstra’s algorithm results in a large search space, researchers resort to index...
-
Article
Study of Impact Resistance Based on Porcupine Quills Bionic Thin-walled Structure
Using an electron microscope to observe the microstructure of a porcupine quills cross-section and a bionic method, a new bionic structure was proposed. The performance of the structure in terms of energy abso...
-
Article
Teleseismic shear wave splitting and intracontinental collision deformation of the northern Tibetan Plateau and the eastern Tarim basin
Shear wave splitting measurement of teleseismic data has been used to determine the fast polarization directions and delay times for 38 temporary stations and 15 permanent stations from a NW linear seismic arr...
-
Article
Rayleigh Wave Phase Velocity Maps at Regional Scale Inferring from SPAC of Ambient Noise at a Dense Array: A Case Study in Northeastern Tibetan Plateau
The SPAC (spatial auto-correlation) of the microtremor is widely used to infer a shallow structure at local scale. On the regional scale, based on the dispersion curves extracted from the interstation NCFs (no...
-
Article
Involvement of Mitophagy in Primary Cultured Rat Neurons Treated with Nanoalumina
The aim of this study was to explore the influence of the neurotoxicity of nanoalumina on primarily cultured neurons. Normal control, particle size control, aluminum, micron-alumina, and nanoalumina at 50-nm a...
-
Article
Open AccessStudy on protective performance and gradient optimization of helmet foam liner under bullet impact
Protective equipment in war plays a vital role in the safety of soldiers, the threat to soldiers from brain damage caused by deformation at the back of the helmet cannot be ignored, so research on reduce blunt...
-
Article
Distance labeling: on parallelism, compression, and ordering
Distance labeling approaches are widely adopted to speed up the online performance of shortest-distance queries. The construction of the distance labeling, however, can be exhaustive, especially on big graphs....
-
Article
Involvement of Mitophagy in Aluminum Oxide Nanoparticle–Induced Impairment of Learning and Memory in Mice
Aluminum oxide nanoparticles (nano-aluminum) have been known to be widespread in the environment for decades. Exposure to nano-aluminum may impair learning and memory, but the potential mechanism has not yet b...
-
Article
Efficient maximum clique computation and enumeration over large sparse graphs
This paper studies the problem of maximum clique computation (MCC) over sparse graphs, as large real-world graphs are usually sparse. In the literature, the problem of MCC over sparse graphs has been studied s...
-
Chapter and Conference Paper
Efficient Closest Community Search over Large Graphs
This paper studies the closest community search problem. Given a graph G and a set of query vertices Q, the closest community of Q in G is the connected subgraph of G that contains Q, is most cohesive (i.e., with...
-
Chapter and Conference Paper
Fast Algorithm for Distance Dynamics-Based Community Detection
Community detection is a fundamental problem in graph-based data analytics. Among many models, the distance dynamics model proposed recently is shown to be able to faithfully capture natural communities that a...
-
Article
Eccentricities on small-world networks
This paper focuses on the efficiency issue of computing and maintaining the eccentricity distribution on a large and perhaps dynamic small-world network. Eccentricity distribution evaluates the importance of e...
-
Article
Efficient structural graph clustering: an index-based approach
Graph clustering is a fundamental problem widely applied in many applications. The structural graph clustering ( \(\mathsf {SCAN}\) ...
-
Article
Leveraging set relations in exact and dynamic set similarity join
Set similarity join, which finds all the similar set pairs from two collections of sets, is a fundamental problem with a wide range of applications. Existing works study both exact set similarity join and appr...
-
Book and Conference Proceedings
-
Chapter and Conference Paper
Computing Maximum Independent Sets over Large Sparse Graphs
This paper studies the fundamental problem of efficiently computing a maximum independent set (or equivalently, a minimum vertex cover) over a large sparse graph, which is receiving increasing interests from ...
-
Article
Distributed computing connected components with linear communication cost
The paper studies three fundamental problems in graph analytics, computing connected components (CCs), biconnected components (BCCs), and 2-edge-connected components (ECCs) of a graph. With the recent advent of b...
