Sciweavers

2135 search results - page 313 / 427
» Database Paper - The IRI Marketing Data Set
Sort
View
85
Voted
BTW
2007
Springer
121views Database» more  BTW 2007»
15 years 7 months ago
Algorithms for merged indexes
B-tree and index into two layers of abstraction. In addition, this paper provides algorithms for (i) concurrency control and recovery including locking of individual keys and of co...
Goetz Graefe
185
Voted
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 2 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
VLDB
2007
ACM
107views Database» more  VLDB 2007»
16 years 29 days ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
Chen Li, Bin Wang, Xiaochun Yang
114
Voted
ADBIS
2009
Springer
127views Database» more  ADBIS 2009»
15 years 7 months ago
Window Update Patterns in Stream Operators
Continuous queries applied over nonterminating data streams usually specify windows in order to obtain an evolving –yet restricted– set of tuples and thus provide timely result...
Kostas Patroumpas, Timos K. Sellis
71
Voted
CIKM
2009
Springer
15 years 7 months ago
YAM: a schema matcher factory
In this paper, we present YAM, a schema matcher factory. YAM (Yet Another Matcher) is not (yet) another schema matching system as it enables the generation of a la carte schema ma...
Fabien Duchateau, Remi Coletta, Zohra Bellahsene, ...