806 search results - page 74 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
171
click to vote
COMAD
2009
15 years 5 months ago
2009
The problem of information integration is discussed in the context of answering a query over the web. Querying the web requires that information from different web and other sourc...
126
click to vote
ICDE
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— Defining suitable indexes is a major task when optimizing a database. Usually, a human database administrator defines a set of indexes in the design phase of the data...
158
click to vote
ICDE
2005
IEEE
15 years 10 months ago
2005
IEEE
Current federated systems deploy cost-based query optimization mechanisms; i.e., the optimizer selects a global query plan with the lowest cost to execute. Thus, cost functions in...
117
click to vote
VLDB
1998
ACM
15 years 8 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
161
click to vote
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...