Остановите войну!
for scientists:
default search action
Christos Doulkeridis
- > Home > Persons > Christos Doulkeridis
Publications
- 2017
- [j17]Konstantinos Georgoulas, Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis:
User-Centric Similarity Search. IEEE Trans. Knowl. Data Eng. 29(1): 200-213 (2017) - 2013
- [c35]Akrivi Vlachou, Christos Doulkeridis, Kjetil Nørvåg, Yannis Kotidis:
Branch-and-bound algorithm for reverse top-k queries. SIGMOD Conference 2013: 481-492 - 2012
- [b2]Akrivi Vlachou, Christos Doulkeridis, Kjetil Nørvåg, Yannis Kotidis:
Peer-to-Peer Query Processing over Multidimensional Data. Springer Briefs in Computer Science, Springer 2012, ISBN 978-1-4614-2109-2, pp. i-xii, 1-84 - [j13]Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis:
Metric-Based Similarity Search in Unstructured Peer-to-Peer Systems. Trans. Large Scale Data Knowl. Centered Syst. 5: 28-48 (2012) - [c32]Christos Doulkeridis, Akrivi Vlachou, Kjetil Nørvåg, Yannis Kotidis, Neoklis Polyzotis:
Processing of Rank Joins in Highly Distributed Systems. ICDE 2012: 606-617 - 2011
- [j10]Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis, Kjetil Nørvåg:
Monochromatic and Bichromatic Reverse Top-k Queries. IEEE Trans. Knowl. Data Eng. 23(8): 1215-1229 (2011) - 2010
- [j9]Christos Doulkeridis, Akrivi Vlachou, Kjetil Nørvåg, Yannis Kotidis, Michalis Vazirgiannis:
Efficient search based on content similarity over self-organizing P2P networks. Peer-to-Peer Netw. Appl. 3(1): 67-79 (2010) - [j8]Akrivi Vlachou, Christos Doulkeridis, Kjetil Nørvåg, Yannis Kotidis:
Identifying the Most Influential Data Objects with Reverse Top-k Queries. Proc. VLDB Endow. 3(1): 364-372 (2010) - [j6]Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis, Michalis Vazirgiannis:
Efficient Routing of Subspace Skyline Queries over Highly Distributed Data. IEEE Trans. Knowl. Data Eng. 22(12): 1694-1708 (2010) - [c26]Christos Doulkeridis, Akrivi Vlachou, Kjetil Nørvåg, Yannis Kotidis, Michalis Vazirgiannis:
On the selectivity of multidimensional routing indices. CIKM 2010: 109-118 - [c25]Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis:
Peer-to-Peer Similarity Search Based on M-Tree Indexing. DASFAA (2) 2010: 269-275 - [c24]Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis, Kjetil Nørvåg:
Reverse top-k queries. ICDE 2010: 365-376 - 2009
- [j5]Christos Doulkeridis, Akrivi Vlachou, Yannis Kotidis, Michalis Vazirgiannis:
Efficient range query processing in metric spaces over highly distributed data. Distributed Parallel Databases 26(2-3): 155-180 (2009) - [c23]Christos Doulkeridis, Akrivi Vlachou, Kjetil Nørvåg, Yannis Kotidis, Michalis Vazirgiannis:
Multidimensional routing indices for efficient distributed query processing. CIKM 2009: 1489-1492 - 2008
- [c16]Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis:
Angle-based space partitioning for efficient parallel skyline computation. SIGMOD Conference 2008: 227-238 - 2007
- [c13]Akrivi Vlachou, Christos Doulkeridis, Yannis Kotidis, Michalis Vazirgiannis:
SKYPEER: Efficient Subspace Skyline Computation over Distributed Data. ICDE 2007: 416-425 - [c12]Christos Doulkeridis, Akrivi Vlachou, Yannis Kotidis, Michalis Vazirgiannis:
Peer-to-Peer Similarity Search in Metric Spaces. VLDB 2007: 986-997
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-04 20:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint