Sciweavers

735 search results - page 60 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
ACL
2011
14 years 3 months ago
Joint Annotation of Search Queries
Marking up search queries with linguistic annotations such as part-of-speech tags, capitalization, and segmentation, is an important part of query processing and understanding in ...
Michael Bendersky, W. Bruce Croft, David A. Smith
CORR
2006
Springer
125views Education» more  CORR 2006»
14 years 12 months ago
10^(10^6) Worlds and Beyond: Efficient Representation and Processing of Incomplete Information
We present a decomposition-based approach to managing probabilistic information. We introduce world-set decompositions (WSDs), a space-efficient and complete representation system ...
Lyublena Antova, Christoph Koch, Dan Olteanu
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
16 years 1 months ago
Rewriting Regular XPath Queries on XML Views
We study the problem of answering queries posed on virtual views of XML documents, a problem commonly encountered when enforcing XML access control and integrating data. We approa...
Wenfei Fan, Floris Geerts, Xibei Jia, Anastasios K...
JAPLL
2010
179views more  JAPLL 2010»
14 years 10 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
ICDE
2003
IEEE
209views Database» more  ICDE 2003»
16 years 1 months ago
An Evaluation of Regular Path Expressions with Qualifiers against XML Streams
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...
Dan Olteanu, François Bry, Tobias Kiesling