Sciweavers

342 search results - page 19 / 69
» Conjunctive Queries over Trees
Sort
View
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
14 years 8 months ago
Rewriting nested XML queries using nested views
We present and analyze an algorithm for equivalent rewriting of XQuery queries using XQuery views, which is complete for a large class of XQueries featuring nested FLWR blocks, XM...
Nicola Onose, Alin Deutsch, Yannis Papakonstantino...
GLOBECOM
2007
IEEE
14 years 2 months ago
An Enhanced RFID Multiple Access Protocol for Fast Inventory
- The relevant performance metric for successful deployment of Radio Frequency Identification (RFID) systems for tag inventory applications is the latency for reading all tags with...
You-Chang Ko, Sumit Roy, Joshua R. Smith, Hyung-Wo...
CSR
2007
Springer
14 years 1 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
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 7 months ago
XPath Whole Query Optimization
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
Sebastian Maneth, Kim Nguyen
ICDT
2005
ACM
139views Database» more  ICDT 2005»
14 years 1 months ago
First Order Paths in Ordered Trees
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled t...
Maarten Marx