Sciweavers

104 search results - page 9 / 21
» Query ranking in probabilistic XML data
Sort
View
SIGMOD
2009
ACM
189views Database» more  SIGMOD 2009»
14 years 7 months ago
Generic and effective semi-structured keyword search
Current semi-structured keyword search and natural language query processing systems use ad hoc approaches to take advantage of structural information. Although intuitive, they ar...
Arash Termehchy, Marianne Winslett
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 7 months ago
FleXPath: Flexible Structure and Full-Text Querying for XML
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank ...
SSD
2005
Springer
175views Database» more  SSD 2005»
14 years 29 days ago
Probabilistic Spatial Queries on Existentially Uncertain Data
We study the problem of answering spatial queries in databases where objects exist with some uncertainty and they are associated with an existential probability. The goal of a thre...
Xiangyuan Dai, Man Lung Yiu, Nikos Mamoulis, Yufei...
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 1 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
EDBT
2010
ACM
210views Database» more  EDBT 2010»
13 years 9 months ago
Keyword search for data-centric XML collections with long text fields
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Current approaches for supporting such queries are either for textcentric XM...
Arash Termehchy, Marianne Winslett