Sciweavers

591 search results - page 32 / 119
» The complexity of XPath query evaluation
Sort
View
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
14 years 8 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 8 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
CW
2005
IEEE
14 years 2 months ago
Applying Transformation-Based Error-Driven Learning to Structured Natural Language Queries
XML information retrieval (XML-IR) systems aim to provide users with highly exhaustive and highly specific results. To interact with XML-IR systems, users must express both their ...
Alan Woodley, Shlomo Geva
EDBT
2004
ACM
313views Database» more  EDBT 2004»
14 years 9 months ago
XQzip: Querying Compressed XML Using Structural Indexing
XML makes data flexible in representation and easily portable on the Web but it also substantially inflates data size as a consequence of using tags to describe data. Although many...
James Cheng, Wilfred Ng
WWW
2008
ACM
13 years 8 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou