Sciweavers

6974 search results - page 416 / 1395
» Querying Semi-Structured Data
Sort
View
WWW
2009
ACM
16 years 7 months ago
Identifying vertical search intention of query through social tagging propagation
A pressing task during the unification process is to identify a user's vertical search intention based on the user's query. In this paper, we propose a novel method to p...
Ning Liu, Jun Yan, Weiguo Fan, Qiang Yang, Zheng C...
197
Voted
WWW
2008
ACM
16 years 7 months ago
Scalable querying services over fuzzy ontologies
Fuzzy ontologies are envisioned to be useful in the Semantic Web. Existing fuzzy ontology reasoners are not scalable enough to handle the scale of data that the Web provides. In t...
Jeff Z. Pan, Giorgos B. Stamou, Giorgos Stoilos, S...
SIGMOD
2007
ACM
121views Database» more  SIGMOD 2007»
16 years 7 months ago
EaseDB: a cache-oblivious in-memory query processor
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...
Bingsheng He, Yinan Li, Qiong Luo, Dongqing Yang
209
Voted
PERCOM
2005
ACM
16 years 6 months ago
Supporting Topographic Queries in a Class of Networked Sensor Systems
Topographic querying is the process of extracting data from a sensor network for understanding the graphic delineation of features of interest in a terrain. Query processing techn...
Mitali Singh, Viktor K. Prasanna
203
Voted
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
16 years 1 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch