Sciweavers

241 search results - page 14 / 49
» Effective pruning for XML structural match queries
Sort
View
TKDE
2012
312views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Efficient Fuzzy Type-Ahead Search in XML Data
—In a traditional keyword-search system over XML data, a user composes a keyword query, submits it to the system, and retrieves relevant answers. In the case where the user has l...
Jianhua Feng, Guoliang Li
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
14 years 8 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
TDM
2004
174views Database» more  TDM 2004»
13 years 8 months ago
Relational Approach to Logical Query Optimization of XPath
To be able to handle the ever growing volumes of XML documents, effective and efficient data management solutions are needed. Managing XML data in a relational DBMS has great pote...
Maurice van Keulen
SIGMOD
2009
ACM
147views Database» more  SIGMOD 2009»
14 years 7 months ago
XML keyword query refinement
Existing works in XML keyword search have addressed the problem of finding matching results of a query. However, user input queries always contain irrelevant or mismatched terms, ...
Jiaheng Lu, Zhifeng Bao, Tok Wang Ling, Xiaofeng M...
ICDE
2005
IEEE
144views Database» more  ICDE 2005»
14 years 8 months ago
ViteX: A Streaming XPath Processing System
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
Yi Chen, Susan B. Davidson, Yifeng Zheng