AH
A.J.H. Hidders
info
Please Note
<p>This page displays the records of the person named above and is not linked to a unique person identifier. This record may need to be merged to a profile.</p>
14 records found
1
The join is a commonly used operation in databases systems. As data volumes explode, join operations between two large relations become challenging. To overcome this challenge, some research adopts FPGAs (field programmable gate arrays) to accelerate this operation. However, increasing the bandwidth between accelerators and main memory provides additional opportunity for improvement. In this paper, we propose a locality-aware hash-join algorithm, and apply this to explore the potential of using FPGAs to accelerate hash-join operations in databases. The tuples in the input tables are partitioned into small buckets such that each bucket can fit into BRAM (Block RAM) of the FPGA. Hash-join probe operations are only performed on buckets with the same bucket number in these two tables. Analysis shows that the proposed method can take advantage of large memory bandwidth and thus provide a high throughput.
...
The join is a commonly used operation in databases systems. As data volumes explode, join operations between two large relations become challenging. To overcome this challenge, some research adopts FPGAs (field programmable gate arrays) to accelerate this operation. However, increasing the bandwidth between accelerators and main memory provides additional opportunity for improvement. In this paper, we propose a locality-aware hash-join algorithm, and apply this to explore the potential of using FPGAs to accelerate hash-join operations in databases. The tuples in the input tables are partitioned into small buckets such that each bucket can fit into BRAM (Block RAM) of the FPGA. Hash-join probe operations are only performed on buckets with the same bucket number in these two tables. Analysis shows that the proposed method can take advantage of large memory bandwidth and thus provide a high throughput.
Computing containment relations between massive collections of sets is a fundamental operation in data management, for example in graph analytics and data mining applications. Motivated by recent hardware trends, in this paper we present two novel solutions for computing set-containment joins over massive sets: the Patricia Trie-based Signature Join (PTSJ) and PRETTI+, a Patricia trie enhanced extension of the state-of-the-art PRETTI join. The compact trie structure not only enables efficient use of main-memory, but also significantly boosts the performance of both approaches. By carefully analyzing the algorithms and conducting extensive experiments with various synthetic and real-world datasets, we show that, in many practical cases, our algorithms are an order of magnitude faster than the state-of-the-art.
...
Computing containment relations between massive collections of sets is a fundamental operation in data management, for example in graph analytics and data mining applications. Motivated by recent hardware trends, in this paper we present two novel solutions for computing set-containment joins over massive sets: the Patricia Trie-based Signature Join (PTSJ) and PRETTI+, a Patricia trie enhanced extension of the state-of-the-art PRETTI join. The compact trie structure not only enables efficient use of main-memory, but also significantly boosts the performance of both approaches. By carefully analyzing the algorithms and conducting extensive experiments with various synthetic and real-world datasets, we show that, in many practical cases, our algorithms are an order of magnitude faster than the state-of-the-art.
Conference paper
(2015)
-
YK Dwivedi, V. Weerakkody, MFWHA Janssen, J Millard, AJH Hidders, D Snijders, NP Rana, EL Slade
Conference paper
(2015)
-
YK Dwivedi, V. Weerakkody, M Janssen, J Millard, Jan Hidders, D Snijders, NP Rana, EL Slade
Governments have always retained public service data internally in their own systems with only limited information provided to the public and other stakeholders such as the business, charitable and NGO communities. However, the rapid advancement of ICTs coupled with electronic publishing via the Internet in the last decade in particular has enabled governments to exploit the potential of wider distribution and use of such data previously held in internal systems. The panellists will discuss how Big, Open and Linked Data (BOLD) can be utilized to drive innovation and what obstacles and challenges may be encountered. Empowering citizens, potential mis-use in identity theft, policy manipulation or market distortion, and the need to combine open data with closed sources will be discussed.
...
Governments have always retained public service data internally in their own systems with only limited information provided to the public and other stakeholders such as the business, charitable and NGO communities. However, the rapid advancement of ICTs coupled with electronic publishing via the Internet in the last decade in particular has enabled governments to exploit the potential of wider distribution and use of such data previously held in internal systems. The panellists will discuss how Big, Open and Linked Data (BOLD) can be utilized to drive innovation and what obstacles and challenges may be encountered. Empowering citizens, potential mis-use in identity theft, policy manipulation or market distortion, and the need to combine open data with closed sources will be discussed.
Conference paper
(2014)
-
Bogdan Ghit, Mihai Capota, Tim Hegeman, Jan Hidders, Dick Epema, Alexandru Iosup
The fourth issue of LNCS Transactions on Petri Nets and Other Models of
Concurrency (ToPNoC) contains revised and extended versions of a selection of
the best papers from the workshops held at the 30th International Conference
on Application and Theory of Petri Nets and Other Models of Concurrency,
Paris, France, June 22¿26, 2009, and from the 10th Workshop and Tutorial on
Practical Use of Coloured Petri Nets and the CPN Tools, Aarhus, Denmark,
October 19¿22, 2009.
...
The fourth issue of LNCS Transactions on Petri Nets and Other Models of
Concurrency (ToPNoC) contains revised and extended versions of a selection of
the best papers from the workshops held at the 30th International Conference
on Application and Theory of Petri Nets and Other Models of Concurrency,
Paris, France, June 22¿26, 2009, and from the 10th Workshop and Tutorial on
Practical Use of Coloured Petri Nets and the CPN Tools, Aarhus, Denmark,
October 19¿22, 2009.
Conference paper
(2009)
-
M Niederhausen, KAM van der Sluijs, AJH Hidders, E Leonardi, GJPM Houben, K Meissner
Conference paper
(2009)
-
Erwin Leonardi, Geert-Jan Houben, Kees van der Sluijs, Jan Hidders, Eelco Herder, Fabian Abel, Daniel Krause, Dominik Heckmann
Many Web applications have offered personalization and adaptation
as their features in order to provide personalized services to their users. The
user profiles are gathered independently by these applications often through an explicit dialogue with the user. As a result, the users have to go through a
similar elicitation process multiple times, that is, providing similar information that is used to build the user profiles to different applications. In the springtime of mashup applications, we observe the importance of considering user information in order to make the presented content more relevant to the user. For this purpose, it is necessary to have a platform/ framework that enables components in the mashup to reuse and exchange user profiles. In this paper, we present the Morpho framework that elicits, enhances, and transforms a user profile from one application to another application in a mashup environment. It deals with semantic and syntactic heterogeneity of data and schema of the user profile. We present the architecture of Morpho and a case study to exemplify the approach followed in this current work.
...
Many Web applications have offered personalization and adaptation
as their features in order to provide personalized services to their users. The
user profiles are gathered independently by these applications often through an explicit dialogue with the user. As a result, the users have to go through a
similar elicitation process multiple times, that is, providing similar information that is used to build the user profiles to different applications. In the springtime of mashup applications, we observe the importance of considering user information in order to make the presented content more relevant to the user. For this purpose, it is necessary to have a platform/ framework that enables components in the mashup to reuse and exchange user profiles. In this paper, we present the Morpho framework that elicits, enhances, and transforms a user profile from one application to another application in a mashup environment. It deals with semantic and syntactic heterogeneity of data and schema of the user profile. We present the architecture of Morpho and a case study to exemplify the approach followed in this current work.