Sciweavers

591 search results - page 55 / 119
» The complexity of XPath query evaluation
Sort
View
INFOVIS
2003
IEEE
15 years 3 months ago
Empirical Comparison of Dynamic Query Sliders and Brushing Histograms
Dynamic queries facilitate rapid exploration of information by real-time visual display of both query formulation and results. Dynamic query sliders are linked to the main visuali...
Qing Li, Chris North
IS
2007
14 years 9 months ago
Semantic optimization techniques for preference queries
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
Jan Chomicki
MDM
2009
Springer
123views Communications» more  MDM 2009»
15 years 4 months ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...
PODS
2006
ACM
196views Database» more  PODS 2006»
15 years 10 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
VLDB
2007
ACM
95views Database» more  VLDB 2007»
15 years 10 months ago
Matching Twigs in Probabilistic XML
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of pro...
Benny Kimelfeld, Yehoshua Sagiv