Sciweavers

1832 search results - page 178 / 367
» Querying RDF Data Using A Multigraph-based Approach
Sort
View
EDBT
2010
ACM
177views Database» more  EDBT 2010»
16 years 1 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
16 years 8 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
16 years 1 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
16 years 6 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
WIDM
2003
ACM
15 years 11 months ago
XPath query transformation based on XSLT stylesheets
Whenever XML data must be shared by heterogeneous applications, transformations between different applicationspecific XML formats are necessary. The state-of-the-art method transf...
Sven Groppe, Stefan Böttcher