Sciweavers

1611 search results - page 232 / 323
» An Access Control Model for Video Database Systems
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
15 years 10 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
PODS
2008
ACM
123views Database» more  PODS 2008»
15 years 10 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
ADBIS
2003
Springer
204views Database» more  ADBIS 2003»
15 years 1 months ago
Hierarchical Bitmap Index: An Efficient and Scalable Indexing Technique for Set-Valued Attributes
Abstract. Set-valued attributes are convenient to model complex objects occurring in the real world. Currently available database systems support the storage of set-valued attribut...
Mikolaj Morzy, Tadeusz Morzy, Alexandros Nanopoulo...
VLDB
1991
ACM
157views Database» more  VLDB 1991»
15 years 1 months ago
Integrating Implicit Answers with Object-Oriented Queries
Queries in object-oriented datab;Lqcs are formulated against a class and retrieve instnnccls of the class sat,isfying a certain predicate on the att,riblltes of the class. The pre...
Hava T. Siegelmann, B. R. Badrinath
EDBT
2010
ACM
189views Database» more  EDBT 2010»
15 years 3 months ago
Efficient physical operators for cost-based XPath execution
The creation of a generic and modular query optimization and processing infrastructure can provide significant benefits to XML data management. Key pieces of such an infrastructur...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...