Sciweavers

2859 search results - page 378 / 572
» Querying Complex Structured Databases
Sort
View
PODS
2008
ACM
109views Database» more  PODS 2008»
16 years 2 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura
NAR
2007
135views more  NAR 2007»
15 years 1 months ago
g: Profiler - a web-based toolset for functional profiling of gene lists from large-scale experiments
g:Profiler (http://biit.cs.ut.ee/gprofiler/) is a public web server for characterising and manipulating gene lists resulting from mining high-throughput genomic data. g:Profiler h...
Jüri Reimand, Meelis Kull, Hedi Peterson, Jaa...
COMPGEOM
2005
ACM
15 years 4 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
EDBT
2010
ACM
392views Database» more  EDBT 2010»
15 years 9 months ago
Position list word aligned hybrid: optimizing space and performance for compressed bitmaps
Compressed bitmap indexes are increasingly used for efficiently querying very large and complex databases. The Word Aligned Hybrid (WAH) bitmap compression scheme is commonly rec...
François Deliège, Torben Bach Peders...
SIGMOD
2002
ACM
135views Database» more  SIGMOD 2002»
16 years 2 months ago
StatiX: making XML count
The availability of summary data for XML documents has many applications, from providing users with quick feedback about their queries, to cost-based storage design and query opti...
Juliana Freire, Jayant R. Haritsa, Maya Ramanath, ...