Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
Modern corporations operate in an extremely complex environment and strongly depend on all kinds of information resources across the enterprise. Unfortunately, with the growth of ...
Large-scale data analysis lies in the core of modern enterprises and scientific research. With the emergence of cloud computing, the use of an analytical query processing infrast...
Tomasz Nykiel, Michalis Potamias, Chaitanya Mishra...
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...