Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/efficient-keyword-search-over-virtual-xml-views-q1I6Ewtjxr
References (59)
-
T. Grabs, H. Schek (2003)
PowerDB-XML: A Platform for Data-Centric and Document-Centric XML Processing -
In this case, since g is in GenPDT(n+1), by line 5 we know that ∃q ∈ g.CTQNodes, q.InPdt = true, and hence byn+1, strLists)) = true. is true. We first show two supporting lemmas -
Z. Chen (2007)
Index structures for matching XML twigs using relational query processorsData Knowl. Eng., 60
-
Andrey Balmin, Vagelis Hristidis, Y. Papakonstantinou (2004)
ObjectRank: Authority-Based Keyword Search in Databases -
Ronald Fagin, A. Lotem, M. Naor (2001)
Optimal aggregation algorithms for middlewareJ. Comput. Syst. Sci., 66
-
S. Amer-Yahia, Nick Koudas, A. Marian, D. Srivastava, David Toman (2005)
Structure and Content Scoring for XML -
Vagelis Hristidis, Y. Papakonstantinou (2002)
DISCOVER: Keyword Search in Relational Databases -
R. Kaushik, R. Krishnamurthy, J. Naughton, R. Ramakrishnan (2004)
On the integration of structure indexes and inverted listsProceedings. 20th International Conference on Data Engineering
-
(1999)
Modern Information Retrieval -
P. O'Neil, E. O'Neil, S. Pal, Istvan Cseri, G. Schaller, Nigel Westbury (2004)
ORDPATHs: insert-friendly XML node labels -
Gustav Fahl, T. Risch (1997)
Query processing over object views of relational dataThe VLDB Journal, 6
-
strLists).root}). Hence the lemma holds This direction follows from Lemma F.3 because ∀id ∈ strLists -
Zhiyuan Chen, J. Gehrke, Flip Korn, Nick Koudas, J. Shanmugasundaram, D. Srivastava (2005)
Index Structures for Matching XML Twigs Using Relational Query Processors21st International Conference on Data Engineering Workshops (ICDEW'05)
-
J. Shanmugasundaram, J. Kiernan, E. Shekita, C. Fan, J. Funderburk (2001)
Querying XML Views of Relational Data -
Y. Mass, Matan Mandelbrod, E. Amitay, David Carmel, Y. Maarek, A. Soffer (2002)
JuruXML - an XML Retrieval System at INEX'02 -
H. Jagadish, S. Al-Khalifa, Adriane Chapman, L. Lakshmanan, Andrew Nierman, Stelios Paparizos, J. Patel, D. Srivastava, Nuwee Wiwatwattana, Yuqing Wu, Cong Yu (2002)
TIMBER: A native XML databaseThe VLDB Journal, 11
-
Chun Zhang, J. Naughton, D. DeWitt, Qiong Luo, G. Lohman (2001)
On supporting containment queries in relational database management systems -
Ronald Fagin (1996)
Combining fuzzy information from multiple systems (extended abstract)Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
-
J. Zobel, Alistair Moffat (1998)
Exploring the similarity spaceSIGIR Forum, 32
-
Stelios Paparizos, Yuqing Wu, L. Lakshmanan, H. Jagadish (2004)
Tree logical classes for efficient evaluation of XQuery -
SungRan Cho (2005)
Indexing for XML Siblings -
(2007)
Efficient ranked keyword search over virtual XML views, technical report TR2007-2077 -
C. Botev, J. Shanmugasundaram (2005)
Context-Sensitive Keyword Search and Ranking for XML -
Zhimin Chen, H. Jagadish, L. Lakshmanan, Stelios Paparizos (2003)
From Tree Patterns to Generalized Tree Patterns: On Efficient Evaluation of XQuery -
Hence the lemma holds Lemma F Given a set of keyword KW, a QPT Q, an XML database D, an enviroment δ -
Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, Soumen Chakrabarti, S. Sudarshan (2002)
Keyword searching and browsing in databases using BANKSProceedings 18th International Conference on Data Engineering
-
G. Salton (1988)
Automatic text processing -
Lin Guo, F. Shao, C. Botev, J. Shanmugasundaram (2003)
XRANK: ranked keyword search over XML documents -
H(n,strLists))=true, we know that ∃cqn ∈ cn.CTQNodes s.t. cqn satisfies the property (*) as described above and -
M. Fernández, W. Tan, Dan Suciu (2000)
SilkRoute: trading between relations and XMLComput. Networks, 33
-
Ronald Fagin (1999)
Combining Fuzzy Information from Multiple SystemsJ. Comput. Syst. Sci., 58
-
A. Bhaskar, C. Botev, M. Chettiar, Lin Guo, J. Shanmugasundaram, F. Shao, Fan Yang (2006)
Quark: an efficient XQuery full-text implementationProceedings of the 2006 ACM SIGMOD international conference on Management of data
-
Vagelis Hristidis, L. Gravano, Y. Papakonstantinou (2003)
Efficient IR-Style Keyword Search over Relational Databases -
Sung-Hyon Myaeng, Don-Hyun Jang, Munseok Kim, Z. Zhoo (1998)
A flexible model for retrieval of SGML documents -
I. Witten, Alistair Moffat, T. Bell (1999)
Managing Gigabytes: Compressing and Indexing Documents and Images -
Ashraf Aboulnaga, J. Naughton, Chun Zhang (2001)
Generating Synthetic Complex-Structured XML Data -
Case a.2.2. Second, if id ∈ CT ((n+1)−−).LeftMostPath, assume cn is the node in CT ((n + 1) − −) -
S. Agrawal, S. Chaudhuri, Gautam Das (2002)
DBXplorer: a system for keyword-based search over relational databasesProceedings 18th International Conference on Data Engineering
-
I. Witten, Alistair Moffat, T. Bell (1999)
Managing gigabytes (2nd ed.): compressing and indexing documents and images -
Case a.2. Second, if id ∈ CT(n), there are further two different mini-cases -
G. Salton (1989)
Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer -
A. Marian, Jérôme Siméon (2003)
Projecting XML Documents -
J. Naughton, D. DeWitt, D. Maier, Ashraf Aboulnaga, Jianjun Chen, Leonidas Galanis, Jaewoo Kang, R. Krishnamurthy, Qiong Luo, N. Prakash, Ravishankar Ramamurthy, J. Shanmugasundaram, Feng Tian, K. Tufte, Stratis Viglas, Y. Wang, Chun Zhang, Bruce Jackson, Anurag Gupta, Rushan Chen (2001)
The Niagara Internet Query System.IEEE Data(base) Engineering Bulletin, 24
-
I. Ilyas, R. Shah, W. Aref, J. Vitter, A. Elmagarmid (2004)
Rank-aware query optimization -
Steffen Schott, M. Noga (2003)
Lazy XSL transformations -
N. Fuhr, K. Großjohann (2001)
XIRQL: a query language for information retrieval in XML documents -
V. Christophides, S. Cluet, Jérôme Siméon (2000)
On wrapping query languages and efficient XML integration -
C. Chan, P. Felber, M. Garofalakis, R. Rastogi (2002)
Efficient filtering of XML documents with XPath expressionsThe VLDB Journal, 11
-
A. Theobald, G. Weikum (2002)
The XXL search engine: ranked retrieval of XML data using indexes and ontologies -
Y. Diao, Peter Fischer, M. Franklin, Raymond To (2002)
YFilter: efficient and scalable filtering of XML documentsProceedings 18th International Conference on Data Engineering
-
Emiran Curtmola, S. Amer-Yahia, Philip Brown, M. Fernández (2005)
GalaTex: a conformant implementation of the XQuery full-text language -
M. Carey, J. Kiernan, J. Shanmugasundaram, E. Shekita, Iyer Subramanian (2000)
XPERANTO: Middleware for Publishing Object-Relational Data as XML Documents -
Masatoshi Yoshikawa, T. Amagasa, Takeyuki Shimura, Shunsuke Uemura (2001)
XRel: a path-based approach to storage and retrieval of XML documents using relational databasesACM Trans. Internet Techn., 1
-
A. Theobald, G. Weikum (2002)
The Index-Based XXL Search Engine for Querying XML Data with Relevance Ranking -
First, since id ∈ Q(n+1), by Lemma F.8, we know that id ∈ CT(n) ∨ ∃cn ∈ CT(n), id ∈ cn.pdtCache. Then we can use the similar argument to reason CT ((n + 1) − −), as in Case a.2 and a -
S. Chaudhuri, L. Gravano, A. Marian (2004)
Optimizing top-k selection queries over multimedia repositoriesIEEE Transactions on Knowledge and Data Engineering, 16
-
S. Bressan, B. Catania, Z. Lacroix, Y. Li, Anna Maddalena (2005)
Accelerating queries by pruning XML documentsData Knowl. Eng., 54
-
S. Al-Khalifa, Cong Yu, H. Jagadish (2003)
Querying structured text in an XML database -
Case a.1. First, if id ∈ GenP DT (n), then by the algorithm GenPDT(n) ⊆ GenPDT(n+1), we know that id ∈ GenPDT(n+1)
- Publisher
- Springer Journals
- Copyright
- Copyright © 2009 by Springer-Verlag
- Subject
- Computer Science; Database Management
- ISSN
- 1066-8888
- eISSN
- 0949-877X
- DOI
- 10.1007/s00778-008-0126-x
- Publisher site
- See Article on Publisher Site
Abstract
Emerging applications such as personalized portals, enterprise search, and web integration systems often require keyword search over semi-structured views. However, traditional information retrieval techniques are likely to be expensive in this context because they rely on the assumption that the set of documents being searched is materialized. In this paper, we present a system architecture and algorithm that can efficiently evaluate keyword search queries over virtual (unmaterialized) XML views. An interesting aspect of our approach is that it exploits indices present on the base data and thereby avoids materializing large parts of the view that are not relevant to the query results. Another feature of the algorithm is that by solely using indices, we can still score the results of queries over the virtual view, and the resulting scores are the same as if the view was materialized. Our performance evaluation using the INEX data set in the Quark (Bhaskar et al. in Quark: an efficient XQuery full-text implementation. In: SIGMOD, 2006) open-source XML database system indicates that the proposed approach is scalable and efficient.
Journal
The VLDB Journal – Springer Journals
Published: Apr 1, 2009