Sciweavers

19 search results - page 2 / 4
» Optimal Top-K Query Evaluation for Weighted Business Process...
Sort
View
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 5 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
14 years 6 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...
DBPL
2007
Springer
75views Database» more  DBPL 2007»
13 years 11 months ago
Querying Structural and Behavioral Properties of Business Processes
BPQL is a novel query language for querying business process specifications, introduced recently in [5, 6]. It is based on an intuitive business processes as rewriting systems, an...
Daniel Deutch, Tova Milo
EDBT
2002
ACM
246views Database» more  EDBT 2002»
14 years 5 months ago
Impact and Potential of User Profiles Used for Distributed Query Processing Based on Literature Services
Applying meta search systems is a suitable method to support the user if there are many different services. Due to information splitting strategies of literature services existing ...
Bethina Schmitt
CIKM
2007
Springer
13 years 9 months ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang