Sciweavers

1238 search results - page 188 / 248
» View-based query containment
Sort
View
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
16 years 19 days ago
Mining reference tables for automatic text segmentation
Automatically segmenting unstructured text strings into structured records is necessary for importing the information contained in legacy sources and text collections into a data ...
Eugene Agichtein, Venkatesh Ganti
PODS
2006
ACM
98views Database» more  PODS 2006»
16 years 10 days ago
Two-variable logic on data trees and XML reasoning
d Abstract] Mikolaj Boja?nczyk Faculty of Mathematics, Informatics and Mechanics Warsaw University Poland Claire David LIAFA Universit?e Paris 7 France Anca Muscholl LIAFA Universi...
Mikolaj Bojanczyk, Claire David, Anca Muscholl, Th...
ICDT
2010
ACM
259views Database» more  ICDT 2010»
15 years 9 months ago
Forward-XPath and extended register automata on data-trees
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
Diego Figueira
APSCC
2009
IEEE
15 years 7 months ago
MORSE: A Model-Aware Service Environment
—In a number of scenarios, services generated using a model-driven development (MDD) approach could benefit from “reflective” access to the information in the models from w...
Ta'id Holmes, Uwe Zdun, Schahram Dustdar
77
Voted
EDBT
2009
ACM
118views Database» more  EDBT 2009»
15 years 7 months ago
Optimized union of non-disjoint distributed data sets
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
Itay Dar, Tova Milo, Elad Verbin