![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "Efficient Indices Using Graph Partitioning in RDF Triple Stores"
@inproceedings{DBLP:conf/icde/YanWZQMP09, author = {Ying Yan and Chen Wang and Aoying Zhou and Weining Qian and Li Ma and Yue Pan}, title = {Efficient Indices Using Graph Partitioning in {RDF} Triple Stores}, booktitle = {Proceedings of the 25th International Conference on Data Engineering, {ICDE} 2009, March 29 2009 - April 2 2009, Shanghai, China}, pages = {1263--1266}, year = {2009}, crossref = {DBLP:conf/icde/2009}, url = {https://doi.org/10.1109/ICDE.2009.216}, doi = {10.1109/ICDE.2009.216}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icde/YanWZQMP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/icde/2009, editor = {Yannis E. Ioannidis and Dik Lun Lee and Raymond T. Ng}, title = {Proceedings of the 25th International Conference on Data Engineering, {ICDE} 2009, March 29 2009 - April 2 2009, Shanghai, China}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://ieeexplore.ieee.org/xpl/conhome/4812371/proceeding}, isbn = {978-0-7695-3545-6}, timestamp = {Tue, 25 Jun 2024 02:57:27 +0200}, biburl = {https://dblp.org/rec/conf/icde/2009.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.