Sciweavers

3269 search results - page 425 / 654
» Query Optimization for XML
Sort
View
INTERNET
2010
283views more  INTERNET 2010»
15 years 4 months ago
Querying the Data Web: The MashQL Approach
 We propose a query formulation language, called MashQL for querying and mashing up structured data on the web. The novelty of  MashQL is that it does not requireÂ...
Mustafa Jarrar, Marios D. Dikaiakos
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
14 years 10 months ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
NIS
1998
131views more  NIS 1998»
15 years 6 months ago
Dynamic Memory Allocation for Large Query Execution
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...
Luc Bouganim, Olga Kapitskaia, Patrick Valduriez
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
16 years 7 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 7 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera