Adaptive query relaxation and top‐ k result sorting of fuzzy spatiotemporal data based on XML

Abstract

With the increasing popularity of Extensible Markup Language (XML) for data representation, there is a lot of interest in searching XML data. Due to the structural

An Efficient Dynamic Programming Algorithm for Finding Group Steiner Trees in Temporal Graphs

“…Te GST problem has been found useful in diferent applications and has attracted much research interest in recent years. Te studies most closely related to our problem include the computation of a minimum spanning tree (MST) in a temporal graph [3,9,29], progressive GST searching in a static graph [20,[30][31][32], keyword searching in relational databases [18,33], and reconstruction of an epidemic over time [34][35][36][37][38][39][40][41].…”

“…the GST problem with node and edge weights was considered and an approximate algorithm is proposed using a DP approach. In [33], a query relaxation algorithm was proposed that solves the small or even empty result sets when performing query operations in temporal graph databases. However, the efcient managing of the time information is key for our solution, which has not been studied in previous algorithms [18,20,30,33,42,43].…”

“…In [33], a query relaxation algorithm was proposed that solves the small or even empty result sets when performing query operations in temporal graph databases. However, the efcient managing of the time information is key for our solution, which has not been studied in previous algorithms [18,20,30,33,42,43]. Moreover, these studies have not considered the case of a GST with a specifed tree root.…”