Zobrazeno 1 - 10
of 275
pro vyhledávání: '"M. Tamer Özsu"'
Publikováno v:
International Journal of Distributed Sensor Networks, Vol 2, Iss 1, Pp 23-54 (2006)
Externí odkaz:
https://doaj.org/article/b50929b676054852b8e2d184542ef392
Autor:
Aida Sheshbolouki, M. Tamer Özsu
Publikováno v:
ACM Transactions on the Web. 17:1-46
Bipartite graphs are rich data structures with prevalent applications and characteristic structural features. However, less is known about their growth patterns, particularly in streaming settings. Current works study the patterns of static or aggreg
Autor:
M. Tamer Özsu
Publikováno v:
Balsillie Papers.
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 34:4453-4467
Autor:
M. Tamer Özsu
Publikováno v:
ACM SIGMOD Record. 51:44-46
This column was established by Richard Snodgrass in 1998 and was continued by Ken Ross from 1999 to 2005. It celebrated one of the key aspects that makes us grow as a research community: the papers that influence us. At each issue, different members
Autor:
M. Tamer Özsu, Aida Sheshbolouki
Publikováno v:
ACM Transactions on Knowledge Discovery from Data. 16:1-43
We study the fundamental problem of butterfly (i.e., (2,2)-bicliques) counting in bipartite streaming graphs. Similar to triangles in unipartite graphs, enumerating butterflies is crucial in understanding the structure of bipartite graphs. This benef
Publikováno v:
The VLDB Journal. 31:287-320
Finding from a big graph those subgraphs that satisfy certain conditions is useful in many applications such as community detection and subgraph matching. These problems have a high time complexity, but existing systems that attempt to scale them are
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f544a7b46f1f1cb48f50914b242e06a
http://arxiv.org/abs/2208.00273
http://arxiv.org/abs/2208.00273
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 33:1692-1707
This paper revisits the classical problem of multiple query optimization in federated RDF systems. We propose a heuristic query rewriting-based approach to optimize the evaluation of multiple queries. This approach can take advantage of SPARQL 1.1 to
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 31:2329-2345
Multi-dimensional, large-scale, and sparse data, which can be neatly represented by sparse tensors, are increasingly used in various applications such as data analysis and machine learning. A high-performance sparse tensor-vector product (SpTV), one