Sciweavers

785 search results - page 74 / 157
» Efficient Processing of Top-k Queries in Uncertain Databases
Sort
View
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
14 years 9 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
14 years 10 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
JSS
2008
68views more  JSS 2008»
13 years 9 months ago
An efficient iconic indexing strategy for image rotation and reflection in image databases
Spatial relationships are important issues for similarity-based retrieval in many image database applications. With the popularity of digital cameras and the related image process...
Wei-Horng Yeh, Ye-In Chang
PPDP
2010
Springer
13 years 6 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
WWW
2008
ACM
14 years 9 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...