Zobrazeno 1 - 10
of 1 386
pro vyhledávání: '"M Tamer"'
We study index-based processing for connectivity queries within sliding windows on streaming graphs. These queries, which determine whether two vertices belong to the same connected component, are fundamental operations in real-time graph data proces
Externí odkaz:
http://arxiv.org/abs/2406.06754
We survey graph reachability indexing techniques for efficient processing of graph reachability queries in two types of popular graph models: plain graphs and edge-labeled graphs. Reachability queries are fundamental in graph processing, and reachabi
Externí odkaz:
http://arxiv.org/abs/2311.03542
The proliferation of RDF datasets has resulted in studies focusing on optimizing SPARQL query processing. Most existing work focuses on basic graph patterns (BGPs) and ignores other vital operators in SPARQL, such as UNION and OPTIONAL. SPARQL querie
Externí odkaz:
http://arxiv.org/abs/2303.13844
Autor:
Ahmed M. Omer, Wagih A. Sadik, Rafik Abbas, Tamer M. Tamer, Mai M. Abd-Ellatif, Mohamed S. Mohy-Eldin
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-20 (2024)
Abstract In the modern era, with the rapid growth of various industries, the issues of energy crisis and environmental pollution have garnered increasing attention. One significant source of industrial pollution is printing and dyeing wastewater. Thi
Externí odkaz:
https://doaj.org/article/be02c36964384566ae5b02ad76743e32
Autor:
Özsu, M. Tamer
There has been an increasing recognition of the value of data and of data-based decision making. As a consequence, the development of data science as a field of study has intensified in recent years. However, there is no systematic and comprehensive
Externí odkaz:
http://arxiv.org/abs/2301.13761
Publikováno v:
PVLDB, 15(11): 3186 - 3198, 2022
Differential computation (DC) is a highly general incremental computation/view maintenance technique that can maintain the output of an arbitrary and possibly recursive dataflow computation upon changes to its base inputs. As such, it is a promising
Externí odkaz:
http://arxiv.org/abs/2208.00273
Memory disaggregation (MD) allows for scalable and elastic data center design by separating compute (CPU) from memory. With MD, compute and memory are no longer coupled into the same server box. Instead, they are connected to each other via ultra-fas
Externí odkaz:
http://arxiv.org/abs/2207.03027
Publikováno v:
In Journal of Algebra 15 February 2025 664 Part A:268-287
Autor:
Tamer M. Tamer, Rafik Abbas, Wagih A. Sadik, Ahmed M. Omer, Mai M. Abd-Ellatif, Mohamed S. Mohy-Eldin
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-16 (2024)
Abstract The present study introduces a new and straightforward method for the amination of Chitosan. This method involves coupling Chitosan (CS) with 2-chloroethylamine (ENH2) in a single step to produce an amino-ethyl Chitosan derivatives with incr
Externí odkaz:
https://doaj.org/article/5e16605526814e2ca4bd37da98b54404
Autor:
Sheshbolouki, Aida, Özsu, M. Tamer
Bipartite graphs are rich data structures with prevalent applications and identifier structural features. However, less is known about their growth patterns, particularly in streaming settings. Current works study the patterns of static or aggregated
Externí odkaz:
http://arxiv.org/abs/2111.12217