( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Holistic Top-k Simple Shortest Path Join in Graphs.

, , , , , и . IEEE Trans. Knowl. Data Eng., 24 (4): 665-677 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Fei-Yu Xu

Fei-Yu Xu

Xu Xu

Xu Xu

Jeffrey Johnson

 

Другие публикации лиц с тем же именем

SCARAB: scaling reachability computation on large graphs., , , и . SIGMOD Conference, стр. 169-180. ACM, (2012)A novel spectral coding in a large graph database., , , и . EDBT, том 261 из ACM International Conference Proceeding Series, стр. 181-192. ACM, (2008)Multimedia Data Storage.. Encyclopedia of Database Systems (2nd ed.), Springer, (2018)A Holistic Algorithm for Efficiently Evaluating Xtwig Joins., , и . DASFAA, том 4947 из Lecture Notes in Computer Science, стр. 571-579. Springer, (2008)Performance Evaluation of a DOM-Based XML Database: Storage, Indexing and Query Optimization., , , , , и . WAIM, том 2419 из Lecture Notes in Computer Science, стр. 13-24. Springer, (2002)False-Negative Frequent Items Mining from Data Streams with Bursting., , , , и . DASFAA, том 3453 из Lecture Notes in Computer Science, стр. 422-434. Springer, (2005)Parameter Free Bursty Events Detection in Text Streams., , , и . VLDB, стр. 181-192. ACM, (2005)Sliding-window top-k queries on uncertain streams., , , , и . VLDB J., 19 (3): 411-435 (2010)Graph Processing in RDBMSs., и . IEEE Data Eng. Bull., 40 (3): 6-17 (2017)Query-driven Frequent Co-occurring Term Extraction over Relational Data using MapReduce, , , , и . CoRR, (2013)