Sciweavers

18 search results - page 2 / 4
» On Testing Satisfiability of Tree Pattern Queries
Sort
View
VLDB
2003
ACM
141views Database» more  VLDB 2003»
14 years 5 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
SIGMOD
2005
ACM
119views Database» more  SIGMOD 2005»
14 years 5 months ago
Update-Pattern-Aware Modeling and Processing of Continuous Queries
A defining characteristic of continuous queries over on-line data streams, possibly bounded by sliding windows, is the potentially infinite and time-evolving nature of their input...
Lukasz Golab, M. Tamer Özsu
ICDT
2003
ACM
126views Database» more  ICDT 2003»
13 years 10 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven
PODS
2006
ACM
98views Database» more  PODS 2006»
14 years 5 months 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...
KDD
2008
ACM
176views Data Mining» more  KDD 2008»
14 years 5 months ago
Context-aware query suggestion by mining click-through and session data
Query suggestion plays an important role in improving the usability of search engines. Although some recently proposed methods can make meaningful query suggestions by mining quer...
Huanhuan Cao, Daxin Jiang, Jian Pei, Qi He, Zhen L...