Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kia Teymourian

dblp:62/56 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2018
0000-0002-3183-4353ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 4 · 2 first-authorSystems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 44% High-performance computing · 44% Storage systems · 13%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.312018
PlinyCompute: A Platform for High-Performance, Distributed, Data-Intensive Tool Development · SIGMOD Conference 2018
High-performance computing › data-intensive computing
distributed data-intensive computing
0.312018
PlinyCompute: A Platform for High-Performance, Distributed, Data-Intensive Tool Development · SIGMOD Conference 2018

Methods — techniques the papers use, named apart from their topics

relational-database style optimization · 0.3memory management · 0.3
YearPublicationVenuePosition
2018 PlinyCompute: A Platform for High-Performance, Distributed, Data-Intensive Tool Development
abstract
This paper describes PlinyCompute, a system for development of high-performance, data-intensive, distributed computing tools and libraries. \emphIn the large, PlinyCompute presents the programmer with a very high-level, declarative interface, relying on automatic, relational-database style optimization to figure out how to stage distributed computations. However, in the small, PlinyCompute presents the capable systems programmer with a persistent object data model and API (the "PC object model'') and associated memory management system that has been designed from the ground-up for high performance, distributed, data-intensive computing. This contrasts with most other Big Data systems, which are constructed on top of the Java Virtual Machine (JVM), and hence must at least partially cede performance-critical concerns such as memory management (including layout and de/allocation) and virtual method/function dispatch to the JVM. This hybrid approach---declarative in the large, trusting the programmer's ability to utilize PC object model efficiently in the small---results in a system that is ideal for the development of reusable, data-intensive tools and libraries.
Jia Zou 0001, R. Matthew Barnett, Tania Lorido-Botran, Shangyu Luo, Carlos Monroy, Sourav Sikdar, Kia Teymourian, Binhang Yuan, Chris Jermaine
SIGMOD Conference7
2017 An experimental comparison of complex object implementations for big data systems
abstract
Many cloud-based data management and analytics systems support complex objects. Dataflow platforms such as Spark and Flink allow programmers to manipulate sets consisting of objects from a host programming language (often Java). Document databases such as MongoDB make use of hierarchical interchange formats---most popularly JSON---which embody a data model where individual records can themselves contain sets of records. Systems such as Dremel and AsterixDB allow complex nesting of data structures.
Sourav Sikdar, Kia Teymourian, Chris Jermaine
SoCC2
2014 Plan-Based Semantic Enrichment of Event Streams
Kia Teymourian, Adrian Paschke
ESWC1
2012 Knowledge-based processing of complex stock market events
abstract
Usage of background knowledge about events and their relations to other concepts in the application domain, can improve the quality of event processing. In this paper, we describe a system for knowledge-based event detection of complex stock market events based on available background knowledge about stock market companies. Our system profits from data fusion of live event stream and background knowledge about companies which is stored in a knowledge base. Users of our system can express their queries in a rule language which provides functionalities to specify semantic queries about companies in the SPARQL query language for querying the external knowledge base and combine it with event data stream. Background makes it possible to detect stock market events based on companies attributes and not only based on syntactic processing of stock price and volume.
Kia Teymourian, Malte Rohde, Adrian Paschke
EDBT1
2010 A self-organized semantic storage service
abstract
Traditional approaches for data storage and analysis are facing their limits when handling the enormous data amounts of today's applications. We believe that a radical departure from contemporary architectures of stores is necessary to satisfy that central scalability requirement. One of the most promising new schools of thought in system design are swarm intelligent and swarm-based approaches for data distribution and organization. In this paper, we describe our current work on a swarm-based storage service for Semantic Web data. This storage service utilizes algorithms discovered in the behavior of ant colonies. We describe these algorithms and our enhancements to them as well as our evaluation of the implementation.
Hannes Mühleisen, Anne Augustin, Tilman Walther, Marko Harasic, Kia Teymourian, Robert Tolksdorf
iiWAS5