Sciweavers

2662 search results - page 337 / 533
» Data Compression Support in Databases
Sort
View
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
15 years 10 months ago
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
Hans-Peter Kriegel, Bernhard Seeger
ICDE
2001
IEEE
104views Database» more  ICDE 2001»
16 years 7 months ago
Bundles in Captivity: An Application of Superimposed Information
What do you do to make sense of a mass of information on a given topic? Paradoxically, you likely add yet more information to the pile: annotations, underlining, bookmarks, cross-...
Lois M. L. Delcambre, David Maier, Shawn Bowers, M...
VLDB
2007
ACM
145views Database» more  VLDB 2007»
16 years 6 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
SIGMOD
2007
ACM
106views Database» more  SIGMOD 2007»
16 years 6 months ago
Highly distributed XQuery with DXQ
Many modern applications, from Grid computing to RSS handling, need to support data processing in a distributed environment. Currently, most such applications are implemented usin...
Jérôme Siméon, Kristi Morton, ...
EDBT
2008
ACM
122views Database» more  EDBT 2008»
16 years 6 months ago
Mining all frequent projection-selection queries from a relational table
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos