Sciweavers

1861 search results - page 181 / 373
» 1.6-Bit Pattern Databases
Sort
View
XIMEP
2005
ACM
121views Database» more  XIMEP 2005»
15 years 8 months ago
Adaptive XML Storage or The Importance of Being Lazy
Building an XML store means finding solutions to the problems of representing, accessing, querying and updating XML data. The irregularity of both the structure and usage of XML, ...
Cristian Duda, Donald Kossmann
130
Voted
SAC
2004
ACM
15 years 8 months ago
A new algorithm for gap constrained sequence mining
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
Salvatore Orlando, Raffaele Perego, Claudio Silves...
138
Voted
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
15 years 6 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
DEXA
2006
Springer
139views Database» more  DEXA 2006»
15 years 6 months ago
Efficient Processing of Multiple XML Twig Queries
Abstract. Finding all occurrences of a twig pattern in an XML document is a core operation for XML query processing. The emergence of XML as a common mark-up language for data inte...
Huanzhang Liu, Tok Wang Ling, Tian Yu, Ji Wu
JBI
2002
105views Bioinformatics» more  JBI 2002»
15 years 2 months ago
Information extraction for enhanced access to disease outbreak reports
Document search is generally based on individual terms in the document. However, for collections within limited domains it is possible to provide more powerful access tools. This ...
Ralph Grishman, Silja Huttunen, Roman Yangarber