Sciweavers

479 search results - page 49 / 96
» Efficient Processing of XML Tree Pattern Queries
Sort
View
VLDB
2003
ACM
141views Database» more  VLDB 2003»
14 years 9 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
ICDE
2008
IEEE
136views Database» more  ICDE 2008»
14 years 10 months ago
Processing Event-Monitoring Queries in Sensor Networks
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
Vassilis Stoumpos, Antonios Deligiannakis, Yannis ...
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
14 years 9 months ago
Query biased snippet generation in XML search
Snippets are used by almost every text search engine to complement ranking scheme in order to effectively handle user searches, which are inherently ambiguous and whose relevance ...
Yu Huang, Ziyang Liu, Yi Chen
PVLDB
2010
128views more  PVLDB 2010»
13 years 3 months ago
Searching Workflows with Hierarchical Views
Workflows are prevalent in diverse applications, which can be scientific experiments, business processes, web services, or recipes. With the dramatically growing number of workflo...
Ziyang Liu, Qihong Shao, Yi Chen
CSR
2007
Springer
14 years 3 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur