Ranking Methods for Skyline Queries

preprint OA: closed
Full text JSON View at publisher
Full text 13,853 characters · extracted from preprint-html · click to expand
Ranking Methods for Skyline Queries | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Ranking Methods for Skyline Queries Mickaël Martin Nevot, Lotfi Lakhal This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7195029/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 16 Feb, 2026 Read the published version in Knowledge and Information Systems → Version 1 posted 19 You are reading this latest preprint version Abstract Multi-criteria decision analysis in databases has been actively studied, especially through the Skyline operator. Yet, few approaches offer a relevant comparison of Pareto optimal, or Skyline, points for high cardinality result sets. We propose to improve the dp-idp method, inspired by tf-idf, a recent approach computing a score for each Skyline point, by introducing the concept of dominance hierarchy. As dp-idp lacks efficiency and does not ensure a distinctive rank, we introduce the RankSky method, the adaptation of Google’s well-known PageRank solution, using a square stochastic matrix, a teleportation matrix, a damping factor, and then a row score eigenvector and the IPL algorithm. For the same reasons as RankSky, and also to offer directly embeddable in DBMS solution, we establish the TOPSIS based CoSky method, derived from both information research and multi-criteria analysis. CoSky automatically ponderates normalized attributes using the Gini index, then computes a score using Salton's cosine toward an ideal point. By coupling multilevel Skyline to dp-idp, RankSky or CoSky, we introduce DeepSky. Implementations of dp-idp, RankSky and CoSky are evaluated experimentally. Multiple-criteria decision analysis Skyline Information retrieval Ranking PageRank Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 16 Feb, 2026 Read the published version in Knowledge and Information Systems → Version 1 posted Editorial decision: Revision requested 10 Oct, 2025 Reviews received at journal 21 Sep, 2025 Reviews received at journal 17 Sep, 2025 Reviews received at journal 12 Sep, 2025 Reviews received at journal 03 Sep, 2025 Reviews received at journal 31 Aug, 2025 Reviewers agreed at journal 25 Aug, 2025 Reviewers agreed at journal 22 Aug, 2025 Reviewers agreed at journal 22 Aug, 2025 Reviewers agreed at journal 19 Aug, 2025 Reviewers agreed at journal 19 Aug, 2025 Reviewers agreed at journal 19 Aug, 2025 Reviewers agreed at journal 17 Aug, 2025 Reviewers agreed at journal 17 Aug, 2025 Reviewers agreed at journal 17 Aug, 2025 Reviewers invited by journal 17 Aug, 2025 Editor assigned by journal 23 Jul, 2025 Submission checks completed at journal 23 Jul, 2025 First submitted to journal 23 Jul, 2025 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-7195029","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":504377362,"identity":"67ffd684-f676-4c84-8c65-70cce135263f","order_by":0,"name":"Mickaël Martin Nevot","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABMUlEQVRIie3Nv0vDQBTA8XccJMuVrgmU/gdCQiBYUPxXPApxUgehdHA4CcQl4BpB8F8oCOJmJGCXaNaIDpVgXDrURSr4686mFprE2eG+Wd698OEByGT/Mcw/gNXZY3O+nQCQYmzXEE2MiBUEHQQLYlXe+SXFBrlk8btEVg5xZkz7Gh9unkePF7DT1LrDbN17aBkhfjojYOwuETtSLOrHGtjxlsloDHt64FB328uJESr2PScdtkwIDhseJ6GDGPW+6CCOTU4iop+OBHk3SlcIvvr45CTJBQF6KUhHEKa+iitVpNtgnKTOjAxU33QRJ00gdjVRLKt1rRE7zVEgSDD06LF/+0N6dydGmSRRpo/319p24sDLGydHLg4n0160oYB6no77JTKP1OyhDshkMpnsr74BIppqrcPe8y0AAAAASUVORK5CYII=","orcid":"","institution":"Aix-Marseille Université","correspondingAuthor":true,"prefix":"","firstName":"Mickaël","middleName":"Martin","lastName":"Nevot","suffix":""},{"id":504377363,"identity":"9fe8987c-58c4-4354-91c1-619fe4de9863","order_by":1,"name":"Lotfi Lakhal","email":"","orcid":"","institution":"Aix-Marseille Université","correspondingAuthor":false,"prefix":"","firstName":"Lotfi","middleName":"","lastName":"Lakhal","suffix":""}],"badges":[],"createdAt":"2025-07-23 10:08:12","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7195029/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7195029/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s10115-026-02684-7","type":"published","date":"2026-02-16T15:57:40+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":103251071,"identity":"340e6e8e-3aad-47c5-9db0-b7c1bcae72ce","added_by":"auto","created_at":"2026-02-23 16:03:33","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":737559,"visible":true,"origin":"","legend":"","description":"","filename":"RankingMethodsForSkylineQueriesKAISMickalMartinNevotEtAl.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7195029/v1_covered_86863294-2d12-47ab-8759-33190eb8b877.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Ranking Methods for Skyline Queries","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"knowledge-and-information-systems","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"kais","sideBox":"Learn more about [Knowledge and Information Systems](http://link.springer.com/journal/10115)","snPcode":"10115","submissionUrl":"https://submission.nature.com/new-submission/10115/3","title":"Knowledge and Information Systems","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Multiple-criteria decision analysis, Skyline, Information retrieval, Ranking, PageRank","lastPublishedDoi":"10.21203/rs.3.rs-7195029/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7195029/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Multi-criteria decision analysis in databases has been actively studied, especially through the Skyline operator. Yet, few approaches offer a relevant comparison of Pareto optimal, or Skyline, points for high cardinality result sets. We propose to improve the dp-idp method, inspired by tf-idf, a recent approach computing a score for each Skyline point, by introducing the concept of dominance hierarchy. As dp-idp lacks efficiency and does not ensure a distinctive rank, we introduce the RankSky method, the adaptation of Google’s well-known PageRank solution, using a square stochastic matrix, a teleportation matrix, a damping factor, and then a row score eigenvector and the IPL algorithm. For the same reasons as RankSky, and also to offer directly embeddable in DBMS solution, we establish the TOPSIS based CoSky method, derived from both information research and multi-criteria analysis. CoSky automatically ponderates normalized attributes using the Gini index, then computes a score using Salton's cosine toward an ideal point. By coupling multilevel Skyline to dp-idp, RankSky or CoSky, we introduce DeepSky. Implementations of dp-idp, RankSky and CoSky are evaluated experimentally.","manuscriptTitle":"Ranking Methods for Skyline Queries","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-08-27 15:42:59","doi":"10.21203/rs.3.rs-7195029/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-10-10T05:50:12+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-09-21T13:57:16+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-09-17T15:05:13+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-09-12T08:53:43+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-09-03T22:15:04+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-09-01T01:51:51+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"335063010158099654398464181766856065381","date":"2025-08-25T04:11:58+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"116900866992707350203503558145918674085","date":"2025-08-22T20:14:27+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"22144199852886728470766360455230598285","date":"2025-08-22T15:01:17+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"253465356648299356649704268537376029591","date":"2025-08-19T18:38:47+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"111816897465955560791756500531274184921","date":"2025-08-19T18:06:53+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"249846418854497341246075839741322814500","date":"2025-08-19T06:18:36+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"73321394248877341519870746681203111797","date":"2025-08-17T19:56:39+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"84229517292540062568415997583595648725","date":"2025-08-17T17:03:03+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"265282403324199922519196806663523949855","date":"2025-08-17T15:57:32+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-08-17T15:53:55+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-07-23T14:37:44+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-07-23T11:28:03+00:00","index":"","fulltext":""},{"type":"submitted","content":"Knowledge and Information Systems","date":"2025-07-23T09:54:15+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"knowledge-and-information-systems","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"kais","sideBox":"Learn more about [Knowledge and Information Systems](http://link.springer.com/journal/10115)","snPcode":"10115","submissionUrl":"https://submission.nature.com/new-submission/10115/3","title":"Knowledge and Information Systems","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"b7ecf3ff-5c0e-4408-a3b3-d4f64d44ee8d","owner":[],"postedDate":"August 27th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2026-02-23T16:01:10+00:00","versionOfRecord":{"articleIdentity":"rs-7195029","link":"https://doi.org/10.1007/s10115-026-02684-7","journal":{"identity":"knowledge-and-information-systems","isVorOnly":false,"title":"Knowledge and Information Systems"},"publishedOn":"2026-02-16 15:57:40","publishedOnDateReadable":"February 16th, 2026"},"versionCreatedAt":"2025-08-27 15:42:59","video":"","vorDoi":"10.1007/s10115-026-02684-7","vorDoiUrl":"https://doi.org/10.1007/s10115-026-02684-7","workflowStages":[]},"version":"v1","identity":"rs-7195029","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7195029","identity":"rs-7195029","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00