 |
Aristotle University Department of Informatics |
|---|
|
DELAB specializes in a broad range of data management topics. Current research activities include the following areas. Query Processing Research in this field focuses on query processing algorithms and indexing schemes towards efficient query processing in database systems. More specifically we focus on preference queries, adaptive query processing, similarity query processing, query processing in spatial and spatiotemporal databases, indexing, distributed query processing. Data Mining and Knowledge Discovery We perform research on the following topics: web mining; graph mining; data mining for data streams and massive datasets/social networks. We contribute to the MOA - Massive Online Analysis tool (http://moa.cms.waikato.ac.nz/) Web and Multimedia Information Retrieval We perform research on the following topics: recommendation systems for social networks; collaborative filtering; model-based recommender systems. Distributed and Massively Parallel Systems The general fields of our interest cover massive parallel, distributed databases, wireless sensor and actuator networks. Specific topics can be described as follows: a) autonomic data management for wide-area environments; b) data management in MapReduce and cloud environments, c) data management on GPUs, d) load balancing in multi-processor systems, e) data storage and query processing, f) energy and resource management in wireless sensor networks, g) in-network processing and aggregation, h) queries over Web Services. Informetrics The general fields of our interest cover bibliometrics, scientometrics, and webometrics. Specific topics can be described as follows: informetric laws (e.g., Lotka, Zipf, but also laws of growth and ageing or obsolescence) hereby also modelling generalised bibliographies, citation theory, linking theory, indicators (definitions and properties), evaluation techniques for scientific output (literature, persons) and for documentary systems (information retrieval) including ranking theory, graph-theoretic and topological analysis of networks (including Internet, intranets, citation and collaboration networks), visualisation and mapping of science (persons, fields, institutes, topics). Theory We perform research on the following topics: Data Structure for Main and Secondary Memory (mainly known "hard problems"), P2P Algorithms and Data Structures (design of overlays), Design and Analysis of Algorithms (fundamental problems), Computational Geometry (fundamental operations and apps to other areas), String Algorithms, Dynamic Graph Algorithms, Complexity (mainly interest on how Physics interact with Informatics) Current Projects:
|