Sciweavers

552 search results - page 27 / 111
» Efficient Algorithms for Processing XPath Queries
Sort
View
174
Voted
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
15 years 12 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
VLDB
2004
ACM
151views Database» more  VLDB 2004»
15 years 5 months ago
Query Rewrite for XML in Oracle XML DB
Oracle XML DB integrates XML storage and querying using the Oracle relational and object relational framework. It has the capability to physically store XML documents by shredding...
Muralidhar Krishnaprasad, Zhen Hua Liu, Anand Mani...
BNCOD
2007
121views Database» more  BNCOD 2007»
15 years 1 months ago
Indexing and Searching XML Documents Based on Content and Structure Synopses
We present a novel framework for indexing and searching schema-less XML documents based on concise summaries of their structural and textual content. Our search query language is X...
Weimin He, Leonidas Fegaras, David Levine
SIGMOD
2007
ACM
176views Database» more  SIGMOD 2007»
15 years 12 months ago
URank: formulation and efficient evaluation of top-k queries in uncertain databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...
ICDE
2006
IEEE
128views Database» more  ICDE 2006»
16 years 1 months ago
Partial Selection Query in Peer-to-Peer Databases
In this paper, we propose DBSampler, a query execution mechanism to answer "partial selection" queries in peerto-peer databases. A partial selection query is an arbitrar...
Farnoush Banaei Kashani, Cyrus Shahabi