Sciweavers

2121 search results - page 22 / 425
» Indexing Incomplete Databases
Sort
View
ICDE
2010
IEEE
172views Database» more  ICDE 2010»
13 years 10 months ago
On the use of query-driven XML auto-indexing
— Autonomous index management in native XML DBMSs has to address XML’s flexibility and storage mapping features, which provide a rich set of indexing options. Change of worklo...
Karsten Schmidt 0002, Theo Härder
WINE
2005
Springer
107views Economy» more  WINE 2005»
14 years 3 months ago
Price of Anarchy of Network Routing Games with Incomplete Information
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...
Dinesh Garg, Yadati Narahari
BTW
2005
Springer
108views Database» more  BTW 2005»
14 years 3 months ago
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
Christoph Brochhaus, Jost Enderle, Achim Schlosser...
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 4 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
BTW
2007
Springer
115views Database» more  BTW 2007»
14 years 4 months ago
Hierarchical locking in B-tree indexes
Goetz Graefe