published ORDU Marrying Top-k with Skyline Queries: Relaxing the Preference Input While Producing Output of Controllable Size T-LevelIndex T-LevelIndex: Towards Efficient Query Processing in Continuous Preference Space Cover Ratio Maximization Bachelor's Degree Thesis ongoing subgrpah matching An Efficient System for Dynamic Path Pattern Matching with Shared Execution and Parallel Computation a multi-dimensional map Quantifying the Competitiveness of a Dataset in Relation to General Preferences dynamic graph storage Dynamic Graph Storage: An Experimental Survey
