default search action
Xixian Han
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j28]Xiaolong Wan, Xixian Han
:
Efficient Top-k Frequent Itemset Mining on Massive Data. Data Sci. Eng. 9(2): 177-203 (2024) - [j27]Kangao Wang
Efficient computation of Top-k G-Skyline groups on large-scale database. Inf. Sci. 670: 120614 (2024) - [j26]Xiaolong Wan
Efficient Discovery of Functional Dependencies on Massive Data. IEEE Trans. Knowl. Data Eng. 36(1): 107-121 (2024) - [j25]Jingxuan He
Efficient Skyline Frequent-Utility Itemset Mining Algorithm on Massive Data. IEEE Trans. Knowl. Data Eng. 36(7): 3009-3023 (2024) - [c9]Xiaolong Wan, Xixian Han, Jinbao Wang, Jianzhong Li:
Efficient Discovery of Functional Dependencies on Massive Data (Extended Abstract). ICDE 2024: 5707-5708 - 2022
- [j24]Jingxuan He
Efficient Skyline Computation on Massive Incomplete Data. Data Sci. Eng. 7(2): 102-119 (2022) - [j23]Jingxuan He
Efficient high-utility occupancy itemset mining algorithm on massive data. Expert Syst. Appl. 210: 118329 (2022) - [j22]Jinbao Wang
Top-k Socially Constrained Spatial Keyword Search in Large SIoT Networks. IEEE Internet Things J. 9(12): 9280-9289 (2022) - [j21]Xixian Han, Jinbao Wang, Jianzhong Li, Hong Gao:
Efficient computation of G-Skyline groups on massive data. Inf. Sci. 587: 300-322 (2022) - [c8]Kaiqi Zhang, Hong Gao, Xixian Han, Jian Chen, Jianzhong Li:
Maximizing Range Sum in Trajectory Data. ICDE 2022: 755-766 - 2021
- [j20]Xixian Han
Efficient top-k high utility itemset mining on massive data. Inf. Sci. 557: 382-406 (2021) - 2020
- [j19]Kaiqi Zhang
Modeling and Computing Probabilistic Skyline on Incomplete Data. IEEE Trans. Knowl. Data Eng. 32(7): 1405-1418 (2020)
2010 – 2019
- 2019
- [j18]Xixian Han
Efficiently Mining Frequent Itemsets on Massive Data. IEEE Access 7: 31409-31421 (2019) - [j17]Xixian Han
Dynamic skyline computation on massive data. Knowl. Inf. Syst. 59(3): 571-599 (2019) - [j16]Xixian Han
Ranking the big sky: efficient top-k skyline computation on massive data. Knowl. Inf. Syst. 60(1): 415-446 (2019) - [j15]Xixian Han
PRS: efficient range skyline computation on massive data via presorting. Knowl. Inf. Syst. 60(3): 1511-1548 (2019) - [j14]Yuliang Wei
A novel approach for Web page modeling in personal information extraction. World Wide Web 22(2): 603-620 (2019) - [c7]Kaiqi Zhang, Jinbao Wang, Muxian Wang, Xixian Han:
Probabilistic Skyline Computation on Vertically Distributed Uncertain Data. ICDCS 2019: 154-163 - 2018
- [j13]Kaiqi Zhang
Finding k-Dominant G-Skyline Groups on High Dimensional Data. IEEE Access 6: 58521-58531 (2018) - [j12]Xixian Han
Efficiently processing deterministic approximate aggregation query on massive data. Knowl. Inf. Syst. 57(2): 437-473 (2018) - [c6]Xixian Han, Jianzhong Li, Hong Gao:
Efficient Top-k Dominating Computation on Massive Data (Extended Abstract). ICDE 2018: 1771-1772 - 2017
- [j11]Xixian Han, Jianzhong Li, Hong Gao:
Efficient Top-k Dominating Computation on Massive Data. IEEE Trans. Knowl. Data Eng. 29(6): 1199-1211 (2017) - [c5]Kaiqi Zhang, Hong Gao, Xixian Han, Zhipeng Cai
Probabilistic Skyline on Incomplete Data. CIKM 2017: 427-436 - [c4]Kaiqi Zhang, Hong Gao, Xixian Han, Donghua Yang, Zhipeng Cai
RSkycube: Efficient Skycube Computation by Reusing Principle. DASFAA (2) 2017: 51-64 - 2016
- [j10]Xixian Han, Xianmin Liu, Jianzhong Li, Hong Gao:
TKAP: Efficiently processing top-k query on massive data by adaptive pruning. Knowl. Inf. Syst. 47(2): 301-328 (2016) - [c3]Xixian Han, Jianzhong Li, Hong Gao:
Efficient top-k retrieval on massive data. ICDE 2016: 1496-1497 - [c2]Chunle Fu, Qinggang He, Bailing Wang, Xixian Han:
A Communication Supportable Generic Model for Mobile VPN on Android OS. ISCC 2016: 1039-1046 - 2015
- [j9]Xixian Han, Jianzhong Li, Hong Gao, Chengyu Yang:
SEPT: an efficient skyline join algorithm on massive data. Knowl. Inf. Syst. 43(2): 355-388 (2015) - [j8]Xixian Han, Jianzhong Li, Hong Gao:
TDEP: efficiently processing top-k dominating query on massive data. Knowl. Inf. Syst. 43(3): 689-718 (2015) - [j7]Xixian Han, Jianzhong Li, Hong Gao:
Efficient Top-k Retrieval on Massive Data. IEEE Trans. Knowl. Data Eng. 27(10): 2687-2699 (2015) - 2014
- [j6]Xixian Han, Jianzhong Li, Hong Gao:
Efficiently processing (p,ε)-approximate join aggregation on massive data. Inf. Sci. 278: 773-792 (2014) - 2013
- [j5]Donghua Yang, Yuqiang Feng, Ye Yuan, Xixian Han, Jinbao Wang, Jianzhong Li:
Ad-hoc aggregate query processing algorithms based on bit-store for query intensive applications in cloud computing. Future Gener. Comput. Syst. 29(7): 1725-1735 (2013) - [j4]Xixian Han, Jianzhong Li, Jinbao Wang, Donghua Yang:
TJJE: An efficient algorithm for top-k join on massive data. Inf. Sci. 222: 362-383 (2013) - [j3]Xixian Han, Jianzhong Li, Donghua Yang, Jinbao Wang:
Efficient Skyline Computation on Big Data. IEEE Trans. Knowl. Data Eng. 25(11): 2521-2535 (2013) - 2012
- [j2]Xixian Han, Jianzhong Li, Donghua Yang:
PI-Join: Efficiently processing join queries on massive data. Knowl. Inf. Syst. 32(3): 527-557 (2012) - 2011
- [j1]Xixian Han, Jianzhong Li, Donghua Yang:
Supporting early pruning in top-k query processing on massive data. Inf. Process. Lett. 111(11): 524-532 (2011) - [c1]Donghua Yang, Jianzhong Li, Xixian Han, Jinbao Wang:
Ad Hoc Aggregation Query Processing Algorithms Based on Bit-Store in Data Intensive Cloud. CyberC 2011: 313-320
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: