Sciweavers

64 search results - page 7 / 13
» View-Based Query Answering and Query Containment over Semist...
Sort
View
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 7 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
14 years 8 months ago
Efficient Query Subscription Processing in a Multicast Environment
Abstract Arturo Crespo, Orkut Buyukkokten, and Hector Garcia-Molina Stanford University With information dissemination (information push), data is delivered from a set of producers...
Arturo Crespo, Orkut Buyukkokten, Hector Garcia-Mo...
COMGEO
2008
ACM
13 years 7 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
DASFAA
2004
IEEE
86views Database» more  DASFAA 2004»
13 years 11 months ago
Supporting Exploratory Queries in Databases
Users of database applications, especially in the e-commerce domain, often resort to exploratory "trial-and-error" queries since the underlying data space is huge and unf...
Abhijit Kadlag, Amol V. Wanjari, Juliana Freire, J...
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
14 years 7 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu