default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStratis Viglas
Person information
- affiliation: University of Edinburgh, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i4]Xi Wu, Xiangyao Yu, Shaleen Deep, Ahmed Mahmood, Uyeong Jang, Stratis Viglas, Somesh Jha, John Cieslewicz, Jeffrey F. Naughton:
Bilevel Relations and Their Applications to Data Insights. CoRR abs/2311.04824 (2023)- 2022
- [j23]Shaleen Deep, Anja Gruenheid, Kruthi Nagaraj, Hiro Naito, Jeffrey F. Naughton, Stratis Viglas:
DIAMETRICS: benchmarking query engines at scale. Commun. ACM 65(12): 105-112 (2022) - [j22]Shaleen Deep, Anja Gruenheid, Paraschos Koutris, Stratis Viglas, Jeffrey F. Naughton:
Comprehensive and Efficient Workload Summarization. Datenbank-Spektrum 22(3): 249-256 (2022) - 2021
- [j21]Shaleen Deep, Anja Gruenheid, Kruthi Nagaraj, Hiro Naito, Jeffrey F. Naughton, Stratis Viglas:
DIAMetrics: Benchmarking Query Engines at Scale. SIGMOD Rec. 50(1): 24-31 (2021) - 2020
- [j20]Anja Gruenheid, Shaleen Deep, Kruthi Nagaraj, Hiro Naito, Jeffrey F. Naughton, Stratis Viglas:
DIAMetrics: Benchmarking Query Engines at Scale. Proc. VLDB Endow. 13(12): 3285-3298 (2020) - [j19]Shaleen Deep, Anja Gruenheid, Paraschos Koutris, Jeffrey F. Naughton, Stratis Viglas:
Comprehensive and Efficient Workload Compression. Proc. VLDB Endow. 14(3): 418-430 (2020) - [i3]Shaleen Deep, Anja Gruenheid, Paraschos Koutris, Jeffrey F. Naughton, Stratis Viglas:
Comprehensive and Efficient Workload Compression. CoRR abs/2011.05549 (2020)
2010 – 2019
- 2018
- [c30]Arpit Joshi, Vijay Nagarajan
, Marcelo Cintra, Stratis Viglas:
DHTM: Durable Hardware Transactional Memory. ISCA 2018: 452-465 - [c29]Jiaqi Yan, Qiuye Jin, Shrainik Jain, Stratis D. Viglas, Allison W. Lee:
Snowtrail: Testing with Production Queries on a Cloud Database. DBTest@SIGMOD 2018: 4:1-4:6 - 2017
- [c28]Fabian Nagel, Gavin M. Bierman, Aleksandar Dragojevic, Stratis Viglas:
Self-managed collections: Off-heap memory management for scalable query-dominated collections. EDBT 2017: 61-71 - [c27]Arpit Joshi, Vijay Nagarajan, Stratis Viglas, Marcelo Cintra:
ATOM: Atomic Durability in Non-volatile Memory through Hardware Logging. HPCA 2017: 361-372 - [c26]Stratis D. Viglas:
Processing Declarative Queries through Generating Imperative Code in Managed Runtimes. ICDE 2017: 1610-1611 - 2016
- [j18]Marios Meimaris, George Papastefanatos, Stratis Viglas, Yannis Stavrakas, Christos Pateritsas, Ioannis Anagnostopoulos:
A query language for multi-version data web archives. Expert Syst. J. Knowl. Eng. 33(4): 383-404 (2016) - 2015
- [j17]Andreas Chatzistergiou, Marcelo Cintra, Stratis D. Viglas:
REWIND: Recovery Write-Ahead System for In-Memory Non-Volatile Data-Structures. Proc. VLDB Endow. 8(5): 497-508 (2015) - [c25]Stratis Viglas:
Declarative Query Processing in Imperative Managed Runtimes. EDBT/ICDT Workshops 2015: 47 - [c24]Arpit Joshi, Vijay Nagarajan, Marcelo Cintra, Stratis Viglas:
Efficient persist barriers for multicores. MICRO 2015: 660-671 - [c23]Stratis D. Viglas:
Data Management in Non-Volatile Memory. SIGMOD Conference 2015: 1707-1711 - [i2]Marios Meimaris, George Papastefanatos, Stratis Viglas, Yannis Stavrakas, Christos Pateritsas:
A Query Language for Multi-version Data Web Archives. CoRR abs/1504.01891 (2015) - 2014
- [j16]Stratis Viglas, Gavin M. Bierman, Fabian Nagel:
Processing Declarative Queries Through Generating Imperative Code in Managed Runtimes. IEEE Data Eng. Bull. 37(1): 12-21 (2014) - [j15]Stratis Viglas:
Write-limited sorts and joins for persistent memory. Proc. VLDB Endow. 7(5): 413-424 (2014) - [j14]Fabian Nagel, Gavin M. Bierman, Stratis D. Viglas:
Code Generation for Efficient Query Processing in Managed Runtimes. Proc. VLDB Endow. 7(12): 1095-1106 (2014) - [j13]Stratis Viglas:
A Comparative Study of Implementation Techniques for Query Processing in Multicore Systems. IEEE Trans. Knowl. Data Eng. 26(1): 3-15 (2014) - [c22]Andreas Chatzistergiou, Stratis D. Viglas:
Fast Heuristics for Near-Optimal Task Allocation in Data Stream Processing over Clusters. CIKM 2014: 1579-1588 - [c21]Stratis D. Viglas:
Just-in-time compilation for SQL query processing. ICDE 2014: 1298-1301 - 2013
- [j12]Stratis D. Viglas:
Data Provenance and Trust. Data Sci. J. 12: GRDI58-GRDI64 (2013) - [j11]Peer Kröger, Stratis Viglas:
Front Matter. Proc. VLDB Endow. 6(2): i-x (2013) - [j10]Stratis Viglas:
Just-in-time compilation for SQL query processing. Proc. VLDB Endow. 6(11): 1190-1191 (2013) - [j9]Peer Kröger, Stratis Viglas:
Front Matter. Proc. VLDB Endow. 6(13): i-x (2013) - [c20]Stratis Viglas:
Nine Years with Peter Buneman. In Search of Elegance in the Theory and Practice of Computation 2013: 507-515 - [c19]Fabian Nagel, Peter A. Boncz, Stratis Viglas:
Recycling in pipelined query evaluation. ICDE 2013: 338-349 - 2012
- [c18]Stratis Viglas:
Adapting the B + -tree for Asymmetric I/O. ADBIS 2012: 399-412 - 2011
- [j8]Philippe Bonnet, Luc Bouganim, Ioannis Koltsidas, Stratis Viglas:
System Co-Design and Data Management for Flash Devices. Proc. VLDB Endow. 4(12): 1504-1505 (2011) - [c17]Ioannis Koltsidas, Stratis Viglas:
Designing a Flash-Aware Two-Level Cache. ADBIS 2011: 153-169 - [c16]Ioannis Koltsidas, Stratis Viglas:
Data management over flash memory. SIGMOD Conference 2011: 1209-1212 - [c15]Ioannis Koltsidas, Stratis Viglas:
Spatial Data Management over Flash Memory. SSTD 2011: 449-453 - 2010
- [c14]Ioannis Koltsidas, Stratis Viglas:
Flash-enabled database storage. ICDE Workshops 2010: 309-312 - [c13]Konstantinos Krikellas, Stratis Viglas, Marcelo Cintra:
Generating code for holistic query evaluation. ICDE 2010: 613-624 - [c12]Konstantinos Krikellas, Stratis Viglas, Marcelo Cintra:
Modeling Multithreaded Query Execution on Chip Multiprocessors. ADMS@VLDB 2010: 22-33
2000 – 2009
- 2008
- [j7]Byron Choi, Gao Cong, Wenfei Fan, Stratis Viglas:
Updating Recursive XML Views of Relations. J. Comput. Sci. Technol. 23(4): 516-537 (2008) - [j6]Ioannis Koltsidas, Stratis Viglas:
Flashing up the storage layer. Proc. VLDB Endow. 1(1): 514-525 (2008) - [j5]Ioannis Koltsidas, Heiko Müller, Stratis Viglas:
Sorting hierarchical data in external memory for archiving. Proc. VLDB Endow. 1(1): 1205-1216 (2008) - 2007
- [c11]Stratis Viglas, Theodore Dalamagas, Vassilis Christophides, Timos K. Sellis, Aggeliki Dimitriou:
Application of the Peer-to-Peer Paradigm in Digital Libraries. DELOS 2007: 318-327 - [c10]Stratis Viglas:
Distributed File Structures in a Peer-to-Peer Environment. ICDE 2007: 406-415 - [c9]Byron Choi, Gao Cong, Wenfei Fan, Stratis Viglas:
Updating Recursive XML Views of Relations. ICDE 2007: 766-775 - 2006
- [j4]Yannis E. Ioannidis, Stratis Viglas:
Conversational querying. Inf. Syst. 31(1): 33-56 (2006) - [i1]Sebastian Obermeier, Joos-Hendrik Böse, Stefan Böttcher, Panos K. Chrysanthis, Alex Delis, Le Gruenwald, Anirban Mondal, Aris M. Ouksel, George Samaras, Stratis Viglas:
06431 Working Group Summary: Atomicity in Mobile Networks. Scalable Data Management in Evolving Networks 2006 - 2005
- [c8]Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutchison, Robert Mann, Stratis Viglas:
Vectorizing and Querying Large XML Repositories. ICDE 2005: 261-272 - [c7]Lisha Ma, Stratis Viglas, Meng Li, Qian Li:
Stream Operators for Querying Data Streams. WAIM 2005: 404-415 - [p1]Stratis Viglas:
Query Execution and Optimization. Stream Data Management 2005: 15-33 - 2004
- [c6]Stratis Viglas:
Pyragrid: Bringing Peer-to-Peer and Grid Architectures Together. DELOS 2004: 1-12 - 2003
- [c5]Jaewoo Kang, Jeffrey F. Naughton, Stratis Viglas:
Evaluating Window Joins over Unbounded Streams. ICDE 2003: 341-352 - [c4]Alan Halverson, Josef Burger, Leonidas Galanis, Ameet Kini, Rajasekar Krishnamurthy, Ajith Nagaraja Rao, Feng Tian, Stratis Viglas, Yuan Wang, Jeffrey F. Naughton, David J. DeWitt:
Mixed Mode XML Query Processing. VLDB 2003: 225-236 - [c3]Stratis Viglas, Jeffrey F. Naughton, Josef Burger:
Maximizing the Output Rate of Multi-Way Join Queries over Streaming Information Sources. VLDB 2003: 285-296 - 2002
- [c2]Stratis Viglas, Jeffrey F. Naughton:
Rate-based query optimization for streaming information sources. SIGMOD Conference 2002: 37-48 - [c1]Igor Tatarinov, Stratis Viglas, Kevin S. Beyer, Jayavel Shanmugasundaram, Eugene J. Shekita, Chun Zhang:
Storing and querying ordered XML using a relational database system. SIGMOD Conference 2002: 204-215 - 2001
- [j3]Jeffrey F. Naughton, David J. DeWitt, David Maier, Ashraf Aboulnaga, Jianjun Chen, Leonidas Galanis, Jaewoo Kang, Rajasekar Krishnamurthy, Qiong Luo, Naveen Prakash, Ravishankar Ramamurthy, Jayavel Shanmugasundaram, Feng Tian, Kristin Tufte, Stratis Viglas, Yuan Wang, Chun Zhang, Bruce Jackson, Anurag Kumar Gupta, Rushan Chen:
The Niagara Internet Query System. IEEE Data Eng. Bull. 24(2): 27-33 (2001) - [j2]Jayavel Shanmugasundaram, Eugene J. Shekita, Jerry Kiernan, Rajasekar Krishnamurthy, Stratis Viglas, Jeffrey F. Naughton, Igor Tatarinov:
A General Techniques for Querying XML Documents using a Relational Database System. SIGMOD Rec. 30(3): 20-26 (2001)
1990 – 1999
- 1998
- [j1]Panagiotis Stamatopoulos, Efstratios Viglas, Serafeim Karaboyas:
Nearly Optimum Timetable Construction Through CLP and Intelligent Search. Int. J. Artif. Intell. Tools 7(4): 415-442 (1998)
Coauthor Index
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 2025-01-20 22:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
