We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
An increasing amount of data is produced in the form of text streams − these can be RSS news feeds, TV closed captions, emails, etc. We study the problem of answering keyword qu...
Vagelis Hristidis, Oscar Valdivia, Michail Vlachos...
Finding objects like music albums or wines in large databases is an inherently difficult problem, especially if users do not know exactly what they are looking for. We propose th...
Protecting data is not simply a case of encrypt and forget: even data with full cryptographic confidentiality and integrity protection can still be subject to information leakage. ...
We address name search for transliterated Arabic given names. In previous work, we addressed similar problems with English and Arabic surnames. In each previous case, we used a va...