Sciweavers

591 search results - page 42 / 119
» The complexity of XPath query evaluation
Sort
View
GRID
2003
Springer
14 years 1 months ago
Scoped and Approximate Queries in a Relational Grid Information Service
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
Dong Lu, Peter A. Dinda, Jason A. Skicewicz
TKDE
2010
200views more  TKDE 2010»
13 years 7 months ago
Incremental and General Evaluation of Reverse Nearest Neighbors
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in t...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...
ALDT
2011
Springer
262views Algorithms» more  ALDT 2011»
12 years 8 months ago
Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach
Abstract. We develop a Bayesian approach to concept learning for crowdsourcing applications. A probabilistic belief over possible concept definitions is maintained and updated acc...
Paolo Viappiani, Sandra Zilles, Howard J. Hamilton...
ICEIS
2009
IEEE
14 years 3 months ago
Relaxing XML Preference Queries for Cooperative Retrieval
Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been ...
SungRan Cho, Wolf-Tilo Balke
ICDE
1995
IEEE
164views Database» more  ICDE 1995»
14 years 10 months ago
Efficient Processing of Nested Fuzzy SQL Queries
?In a fuzzy relational database where a relation is a fuzzy set of tuples and ill-known data are represented by possibility distributions, nested fuzzy queries can be expressed in ...
Qi Yang, Chengwen Liu, Jing Wu, Clement T. Yu, Son...