Výsledky vyhledávání - "Yakovets, N."

Autor: Salihoglu, Semih, Yakovets, N., Sakr, Sherif, Zomaya, Albert Y.

Publikováno v: Encyclopedia of Big Data Technologies, 890-898
STARTPAGE=890;ENDPAGE=898;TITLE=Encyclopedia of Big Data Technologies
Encyclopedia of Big Data Technologies ISBN: 9783319639628
Encyclopedia of Big Data Technologies

While being eminently useful in a wide variety of application domains, the high expressiveness of graph queries makes them hard to optimize and, hence, challenging to process efficiently. We discuss a number of state-of-the-art approaches which aim t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::98e6511b8ff53ec0a16b9c4107ceed7d
https://research.tue.nl/nl/publications/55606c9a-305a-44b6-aa88-4490fdff5c33

Zobrazit plný text záznamu

Conference

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

TASWEET : optimizing disjunctive regular path queries in graph databases

Autor: Abul-Basher, Z., Yakovets, N., Godfrey, P., Ghajar-Khosravi, S., Chignell, M.H., Mitschang, Bernhard, Markl, Volker, Bress, Sebastian, Andritsos, Periklis, Sattler, Kai-Uwe, Orlando, Salvatore

Publikováno v: 20th International Conference on Extending Database Technology, 21-24 march 2017, Venice, Italy, 470-473
STARTPAGE=470;ENDPAGE=473;TITLE=20th International Conference on Extending Database Technology, 21-24 march 2017, Venice, Italy

Regular path queries (RPQs) have quickly become a staple to explore graph databases. SPARQL 1.1 includes prop- erty paths, and so now encompasses RPQs as a fragment. Despite the extreme utility of RPQs, it can be exceedingly difficult for even expert

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::6c40b6ae13e741fbd9f3ed5c7d0d0c67
https://research.tue.nl/nl/publications/e225fd60-e048-4e6b-b4f1-c87df25c5a8e

Zobrazit plný text záznamu

Stability notions in synthetic graph generation: a preliminary study

Autor: van Leeuwen, W., Fletcher, G.H.L., Yakovets, N., Bonifati, A., Mitschang, Bernhard, Markl, Volker, Bress, Sebastian, Andritsos, Periklis, Sattler, Kai-Uwe, Orlando, Salvatore

Publikováno v: Advances in database technology-EDBT 2017 20th International Conference on Extending Database Technology, Venice, Italy, March 21-24, 2017 : proceedings, 486-489
STARTPAGE=486;ENDPAGE=489;TITLE=Advances in database technology-EDBT 2017 20th International Conference on Extending Database Technology, Venice, Italy, March 21-24, 2017 : proceedings

With the rise in adoption of massive graph data, it be- comes increasingly important to design graph processing algorithms which have predictable behavior as the graph scales. This work presents an initial study of stability in the context of a schem

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::4196403906537deba2673998458b1abc
https://research.tue.nl/nl/publications/c3e04e5b-d3d2-4383-a009-a60a998e3bf8

Zobrazit plný text záznamu

Declarative graph querying in practice and theory

Autor: Fletcher, G.H.L., Voigt, H., Yakovets, N., Mitschang, Bernhard, Markl, Volker, Bress, Sebastian, Andritsos, Periklis, Sattler, Kai-Uwe, Orlando, Salvatore

Publikováno v: Advances in database technology-EDBT 2017 : 20th International Conference on Extending Database Technology, Venice, Italy, March 21-24, 2017 : proceedings, 598-601
STARTPAGE=598;ENDPAGE=601;TITLE=Advances in database technology-EDBT 2017 : 20th International Conference on Extending Database Technology, Venice, Italy, March 21-24, 2017 : proceedings

With the recent resurgence of interest in graph data man- agement, there has been a flurry of research on the design and engineering of graph query languages. On the design side, there is a large body of theoretical results that have been obtained re

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::d3f08aa440bf741ffd83851dcca43ae9
https://research.tue.nl/nl/publications/3b4d8d95-35fd-40a0-a983-13ed57a9d4f9

Zobrazit plný text záznamu

WIREFRAME: two-phase, cost-based optimization for conjunctive regular path queries

Autor: Godfrey, P., Yakovets, N., Abul-Basher, Z., Chignell, M.H., Reutter, J., Srivastava, D.

Publikováno v: AMW 2017: Alberto Mendelzon Workshop on Foundations of Data Management and the Web: Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, Montevideo, Uruguay, June 7-9, 2017
AMW 2017: Alberto Mendelzon Workshop on Foundations of Data Management and the Web

While graph databases and their applications are coming into wide use, we are only at the very beginning of understanding how to scale these systems well. Recent work has brought a cost-based optimization approach to RPQs [6]. We set out a framework

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::24bd26e622a841065a7e26e1f4b9c160
https://research.tue.nl/nl/publications/e446510e-0085-48e3-97b8-d4140cb0efb4

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání