Sciweavers

1429 search results - page 11 / 286
» Efficient processing of XPath queries using indexes
Sort
View
SIGMOD
2002
ACM
148views Database» more  SIGMOD 2002»
14 years 7 months ago
Accelerating XPath location steps
This work is a proposal for a database index structure that has been specifically designed to support the evaluation of XPath queries. As such, the index is capable to support all...
Torsten Grust
XSYM
2007
Springer
150views Database» more  XSYM 2007»
14 years 1 months ago
Fast Answering of XPath Query Workloads on Web Collections
Several web applications (such as processing RSS feeds or web service messages) rely on XPath-based data manipulation tools. Web developers need to use XPath queries effectively o...
Mariano P. Consens, Flavio Rizzolo
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
14 years 7 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
ICSNC
2007
IEEE
14 years 1 months ago
Efficient Transformation Scheme for Indexing Continuous Queries on RFID Streaming Data
RFID data are usually regarded as streaming data that are huge and change frequently because they are gathered continuously by numerous readers. RFID middleware filters the data a...
Jaekwan Park, Bonghee Hong, ChaeHoon Ban
CIKM
2009
Springer
13 years 11 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng