Sciweavers

2635 search results - page 177 / 527
» Algorithms for the Database Layout Problem
Sort
View
PODS
2009
ACM
134views Database» more  PODS 2009»
16 years 5 months ago
Equivalence of nested queries with mixed semantics
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
David DeHaan
KDD
2007
ACM
137views Data Mining» more  KDD 2007»
16 years 5 months ago
Characterising the difference
Characterising the differences between two databases is an often occurring problem in Data Mining. Detection of change over time is a prime example, comparing databases from two b...
Jilles Vreeken, Matthijs van Leeuwen, Arno Siebes
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
16 years 4 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis
SSD
1997
Springer
154views Database» more  SSD 1997»
15 years 8 months ago
On the Assessment of Generalisation Consistency
Theory, algorithms, techniques and tools for producing a generalisation of a map have long been available. In this paper we study the inverse problem, namely, given two maps L and...
Vasilis Delis, Thanasis Hadzilacos
162
Voted
IPPS
2008
IEEE
15 years 11 months ago
High-speed string searching against large dictionaries on the Cell/B.E. Processor
Our digital universe is growing, creating exploding amounts of data which need to be searched, protected and filtered. String searching is at the core of the tools we use to curb...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...