Sciweavers

2492 search results - page 301 / 499
» Ontology-based Database Access
Sort
View
IDEAS
2005
IEEE
142views Database» more  IDEAS 2005»
16 years 5 days ago
Automatically Maintaining Wrappers for Web Sources
A substantial subset of the web data follows some kind of underlying structure. Nevertheless, HTML does not contain any schema or semantic information about the data it represents...
Juan Raposo, Alberto Pan, Manuel Álvarez, J...
XIMEP
2005
ACM
121views Database» more  XIMEP 2005»
16 years 4 days 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
CIKM
2005
Springer
16 years 3 days ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
DOLAP
2004
ACM
16 years 9 hour ago
PrefixCube: prefix-sharing condensed data cube
BST Condensed Cube is a fully computed cube that condenses those tuples, which are aggregated from the same single base relation tuple, into one physical tuple. Although it has be...
Jianlin Feng, Qiong Fang, Hulin Ding
CINQ
2004
Springer
125views Database» more  CINQ 2004»
15 years 12 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders