Sciweavers

1445 search results - page 86 / 289
» XPath query containment
Sort
View
ADC
2003
Springer
94views Database» more  ADC 2003»
15 years 3 months ago
Multi-resolution Algorithms for Building Spatial Histograms
Selectivity estimation of queries not only provides useful information to the query processing optimization but also may give users a preview of processing results. In this paper,...
Qing Liu, Yidong Yuan, Xuemin Lin
PODS
1999
ACM
160views Database» more  PODS 1999»
15 years 2 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
WWW
2004
ACM
15 years 10 months ago
Distributed ranking over peer-to-peer networks
Query flooding is a problem existing in Peer-to-Peer networks like Gnutella. Firework Query Model solves this problem by Peer Clustering and routes the query message more intellig...
Dexter Chi Wai Siu, Tak Pang Lau
ICDE
2010
IEEE
276views Database» more  ICDE 2010»
15 years 4 months ago
X-data: Generating test data for killing SQL mutants
Abstract— Checking if an SQL query has been written correctly is not an easy task. Formal verification is not applicable, since it is based on comparing a specification with an...
Bhanu Pratap Gupta, Devang Vira, S. Sudarshan
COMGEO
2008
ACM
14 years 10 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos