Sciweavers

1709 search results - page 120 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
16 years 5 months ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 10 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
CIBCB
2009
IEEE
15 years 6 months ago
An application of the metric access methods to the mass spectrometry data
Mass spectrometry is a very popular method for protein and peptide identification nowadays. Abundance of data generated in this way grows exponentially every year and although ther...
Jiri Novák, David Hoksza
SIGMOD
2011
ACM
193views Database» more  SIGMOD 2011»
14 years 7 months ago
Fast checkpoint recovery algorithms for frequently consistent applications
Advances in hardware have enabled many long-running applications to execute entirely in main memory. As a result, these applications have increasingly turned to database technique...
Tuan Cao, Marcos Antonio Vaz Salles, Benjamin Sowe...
TJS
2008
105views more  TJS 2008»
15 years 5 months ago
Using a relational database for scalable XML search
XML is a flexible and powerful tool that enables information and security sharing in heterogeneous environments. Scalable technologies are needed to effectively manage the growing...
Rebecca Cathey, Steven M. Beitzel, Eric C. Jensen,...